「algorithms」の共起表現(1語右で並び替え)

「algorithms」の共起表現一覧(1語右で並び替え)

algorithms

1 2 3 次へ＞

1語右で並び替え

該当件数:518件

R. Sharan, and R. Shamir, "Biclustering Algorithms: A Survey", In Handbook of Computational Mol
In theoretical discussions of algorithms a kind of general position is often assumed,
larger group, and some group identification algorithms actually identify the Leo Triplet as part of
e, over 500,000 entries as of 2006; computer algorithms allow rapid peak matching.
Applications of geometry processing algorithms already cover a wide range of areas from mul
Genetic algorithms: an adaptive search technique with very broa
ory and practice of collective robotics, ant algorithms and machine consciousness, among other sub-f
may simplify the description and analysis of algorithms, and improve their readability.
d to understand the dynamics of evolutionary algorithms and to put evolutionary computation on forma
Prize from the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).
ed laboratory instruments, devices, software algorithms, and methodologies used to enable, expedite
o be a popular means for describing computer algorithms and are still used for this purpose.
MA Journal of Numerical Analysis], Numerical Algorithms, and Foundations of Computational Mathematic
areas for developing, optimizing and testing algorithms and software related to the “plant controlle
oundations of Networked Computation: Models, Algorithms and Information Management".
Centre for Advanced Computing - Algorithms and Cryptography
en source infrastructure, SeerSuite, and new algorithms and their implementations.
Parallel Applications, Libraries, Languages, Algorithms, and Systems.
Given a dynamic set of objects, find algorithms and data structures for efficient recalculat
Instead of implementing the rendering algorithms and statements, like in imperative programmi
One of the key inventors in Fault Detection Algorithms and Electrical Designer of RTKL Associates i
, CA, where he was involved in the design of algorithms and architectures for several radar and sona
r of various networks, the design of auction algorithms, and the design and analysis of various busi
Boolean Functions: Theory, Algorithms and Applications (with Y. Crama).
emphasizing theoretical studies of parallel algorithms and architectures, VLSI design and layout, a
(book chapter in Boolean Functions: Theory, Algorithms and Applications, Y. Crama and P.L. Hammer,
Combinatorial Optimization: Algorithms and Complexity (with Kenneth Steiglitz).
Force lieutenant with expertise in parallel algorithms and quantum electronics, is dead.
as published by Springer as volume 19 of the Algorithms and Computations in Mathematics series.
, a researcher in the design and analysis of algorithms, and the founding chair of the computer scie
Tiger, and TIGER2), MACs (HMAC for all hash algorithms), and public key algorithms (RSA, ElGamal, D
nal geometry, scientific computing, parallel algorithms and randomized algorithms.
The Journal of Graph Algorithms and Applications (ISSN 1526-1719) is an open
methods of solving a Rubik's Cube, including algorithms and diagrams for a "Beginners' Solution", an
the development of algorithms and mathematics appropriate for real-time we
The development of the BARON algorithms and software has been recognized by the 2004
It integrates various ideas from parallel algorithms, and functional programming and array progra
es design of experiments (DOE), optimization algorithms and robust design tools, that can be combine
rstood or open-ended, or it's not clear what algorithms and data structures might be needed for an i
-workers pioneered many useful and versatile algorithms and methods ranging from "GRASP" (General Pu
system design; and on the interface between algorithms and physical equipment.
Service Prize, ACM Special Interest Group on Algorithms and Computation Theory, 2001.
nstitutions such as MIT and used to test the algorithms and its accuracy.
alogical reasoning, Complex Systems, genetic algorithms and cellular automata, and her publications
novo for larger proteins will require better algorithms and larger computational resources like thos
s the design and evaluation of cryptographic algorithms and protocols (where it contributes actively
Logic analysis evaluates the equations, algorithms, and control logic of the software design.
cian known for his research in the theory of algorithms and their applications, combinatorial optimi
numerous research articles about distributed algorithms and impossibility results, and about formal
He is known for his work in graph algorithms and the reconstruction conjecture and is aff
novo for larger proteins will require better algorithms and larger computational resources like thos
Graphs, algorithms, and optimization By William Kocay, Donald L
alogical instruments, as well as for various algorithms and methods that bear his name.
eueing theory, the probabilistic analysis of algorithms, and the theory of communications pricing an
a large set of numbers (and uses some clever algorithms and fast implementations), it is a lot bette
bias and the effects of software processing algorithms, and comparing various sequencing methods to
This permits fine-grained control of all the algorithms and techniques used in MyDefrag.
quired security tokens, supported encryption algorithms, and privacy rules) and how to associate pol
uter-assisted molecular discovery; his novel algorithms and software; and his contributions to the l
His research covers area of Data Structure, Algorithms and Computational geometry.
This mechanism is useful to document algorithms and generate new functions.
er and Andrew Childs, on quantum computation algorithms and time-travel computations.
s that can be extended to build new learning algorithms and neural networks architectures.
He is notable for his work on quantum algorithms, and the application of information theory c
Indian consumers, by leveraging proprietary algorithms and data in the Indian context.
has contributed to the design of concurrent algorithms, and in particular to the exposition and qua
ural language processing, a large library of algorithms and answers queries using the approach descr
Novel Algorithms and Techniques in Telecommunications, Automa
n Woods was doing doctoral research in graph algorithms, and he designed this maze as (almost) a com
He is director of the Center for Algorithms and Interactive Scientific Software, which g
Tables, figures, algorithms, and video and audio clips are also included
The algorithms and neural nets designed for calculating the
tical chemistry with specialized techniques, algorithms, and sampling equipment for solving problems
is the generic title of a series of books on algorithms and numerical analysis by William H. Press,
xactly, and one must resort to approximation algorithms and heuristics
Search results are ranked through algorithms and the number of views a website has receiv
focusing on subdivision surfaces, rendering algorithms and the simulation of natural physical pheno
code for Laplacian Eigenmaps can be found in algorithms and the PhD thesis of Belkin can be found at
sics, dynamical systems, sequential sampling algorithms, and complex systems.
Webb Miller has been developing algorithms and software for analyzing DNA sequences and
l can express both sequential and concurrent algorithms and features means to handle nondeterminism,
nguages course, and a postgraduate course on algorithms and data structures.
owerful tool to develop new image processing algorithms and explore new image processing techniques
ombinatorics, computer game theory, advanced algorithms and data structures.
h Museum technique at the NIST Dictionary of Algorithms and Data Structures..
ic publications that are documenting various algorithms, and also in planning of computer program de
n introductory programming, data structures, algorithms, and artificial intelligence.
eam of researchers in the development of new algorithms and programs for accurate and efficient simu
H 2.0 protocol encrypts data with public key algorithms and protects connections from man-in-the-mid
ted through the use of sensors and detection algorithms and, subsequently, integrated with other tec
Evolutionary Algorithms Applied to History Matching of Complex Reser
ems: performance and scalability; innovative algorithms, architectures, compilers, languages and pro
e known for their versatility in modeling of algorithms, architectures, languages, protocols and vir
The computing science of syntax and algorithms are used to form search results from data or
Her software libraries implementing these algorithms are widely used in commercial applications i
The calculations performed by the algorithms are constantly evolving, increasing in compl
tion of the nodes (pixels) output from these algorithms are considered an object segment in the imag
Cache-oblivious algorithms are typically analyzed using an idealized mo
Other detection algorithms are not adaptive.
asic block boundaries as well, and different algorithms are used to compute the mappings.
The computer algorithms are produced by bioinformatists.
languages the control component is fixed and algorithms are specified by supplying only the logic co
Line segment intersection algorithms are more expensive than good planarity testi
Such algorithms are called Las Vegas algorithms, which disti
Programming languages and scheduling algorithms are designed to minimize this blocking, and
More classical mono-objective algorithms are as well available, as like as Gradient-b
Algorithms are typically significantly more concise in
The algorithms are coded in a domain specific language call
e of the results it returns, and the ranking algorithms are one of the keys to becoming a big player
Graph algorithms are a significant field of interest within c
does not apply grammatical rules, since its algorithms are based on statistical analysis rather tha
s, machine learning and statistical learning algorithms are available.
used than before because image differencing algorithms are often used to detect moving objects more
an important distinction, as message passing algorithms are usually exact for trees, but only approx
However, effective approximation algorithms are known with approximation ratios that are
rmitted using those coordinates, then faster algorithms are possible.
More efficient algorithms are also known for certain special classes o
Weighting algorithms are provided to optimize the curve fit and a
Medical algorithms are part of a broader field which is usually
Basic algorithms are not CPU-intensive, but are not as good a
Algebraic-group factorisation algorithms are algorithms for factoring an integer N by
in product, Learning Search, is not based on algorithms as many search technologies are, but is dete
ary of mathematics, science, and engineering algorithms as well as the ETS (Enthought Tool Suite) li
structure for coding parallel linear algebra algorithms at a high level of abstraction.
cial intelligence human intelligence-infused algorithms automatically cluster and categorize search
there are usually a wide range of different algorithms available; sometimes a solver implements mul
This is beneficial for many algorithms based on the k nearest neighbors, for exampl
Geometry algorithms based on Java Topology Suite
The real time search engine uses proprietary algorithms based on twitter mentions, facebook shares,
Medical algorithms based on best practice can assist everyone i
the fact why many reported graph isomorphism algorithms behave well in practice.
f research for the problem is design of fast algorithms, both for the general problem and for specia
erally twice as fast as the traditional DAWG algorithms, but take about 5 times as much space for re
al, unlike some other known DFA minimization algorithms, but in many examples it performs more quick
time (this is not true of the Earley and CYK algorithms, but the original Earley algorithms can be m
e Carlo and discrete element digital packing algorithms, C. Xu, X. Jia, R.A. Williams, E.H. Stitt, M
Using new algorithms called P4P researchers have shared files ove
Other algorithms can be easily added to Carrot².
became the common tools of the trade, since algorithms can be expressed much more concisely and rea
The implementation of the decision algorithms can vary ranging from simple as accepting th
1. how algorithms can be boosted by special purpose physical d
Flexibility: force-directed algorithms can be easily adapted and extended to fulfil
Many cryptographic algorithms can be implemented (or masked by a proxy) in
tain a full-color image, various demosaicing algorithms can be used to interpolate a set of complete
The design algorithms can be continuously improved and any changes
Such algorithms can be of use in inferring the topology of a
Custom hybrid and decomposition algorithms can be constructed using the GMP system libr
Feature selection algorithms can be used to learn the Markov blanket of a
signed systems can also recognize when their algorithms cannot make a reliable identification and re
complex computer programming problems using algorithms capable of delivering results in a limited t
tremely hard, and to tackle it with computer algorithms, certain assumptions are made about admissib
ned and posed with difficult programming and algorithms challenges, to be solved in a short span of
babilistic Bayesian analysis or fuzzy logics algorithms, cluster analysis, artificial neural network
mathematician, whose research concerns graph algorithms, combinatorial designs, and their applicatio
Sanders received his Ph.D. in algorithms, combinatorics, and optimization from Georgi
term weighting, document scoring and ranking algorithms, combining evidence from different sources,
dimensions, which simplifies definitions and algorithms comparing to combinatorial maps.
Because MTP/IP uses proprietary algorithms, compatible software must be installed on bo
systems, network emulation, network routing algorithms, compiler directed frameworks and parallel s
Graph Algorithms, Computer Science Press, 1979.
d as Wilson-Han-Powell method), trust region algorithms, conjugate direction method (also called Pow
n-Sutherland computer graphics line clipping algorithms, created with Ivan Sutherland.
a computer scientist active in the fields of algorithms, data structures and calendrical calculation
Introduction to Algorithms, Data Structures and Formal Languages.
onal is a term in computing used to describe algorithms, data structures or programming languages th
are on the design and analysis of efficient algorithms, data structures, parallel computing, interc
y collect softly referenced objects when its algorithms decide that memory is low enough to warrant
aphs, opening their use to a large number of algorithms defined on these structures.
finement of the Russell and American Soundex algorithms designed to allow greater accuracy in matchi
Winzip 15.5 (April 2011) new compression algorithms designed for multi-processor systems that zi
The checkweigher's controller uses algorithms designed to monitor the weight of the contai
The library drew heavily on algorithms developed by James Wilkinson, which were ori
izer (OCR) to the input of synthesis-by-rule algorithms developed at Haskins Laboratories.
Due to its strong type safety algorithms developed that way are more stable and robus
Tree rearrangements are used in heuristic algorithms devoted to searching for an optimal tree str
lopers formulate synchronous or asynchronous algorithms directly in their favorite .NET language - a
raph theory, parallel computing, analysis of algorithms, discrete mathematics, and VLSI design.
ed include simulated annealing, evolutionary algorithms, distributed multipole analysis, basin hoppi
Research in combinatorial algorithms, distributive programming, experimental grap
e, are digital signatures required, and what algorithms do they use
rystalTalk technology uses sound enhancement algorithms embedded within digital signal processor chi
Block cipher algorithms encrypt blocks of bytes of plaintext a block
s' research is in the design and analysis of algorithms, especially online algorithms, approximation
icient development of practical optimization algorithms, especially algorithms based on successive a
g technologies, develop efficient scheduling algorithms, etc. before they can go-to-market with it.
Fast and efficient compression algorithms even allow the binding of private pupil comp
Several approximation algorithms exist with an approximation of 2 − 2/k.
Several algorithms exist to perform translation using SynCFGs.
A number of algorithms exist which start from the rectilinear minim
t-case asymptotic complexity, although other algorithms exist with better average running time in ma
Efficient numerical algorithms exist for computing the curvlet transform of
However, good algorithms exist which balance performance with quality
Asymptotically faster algorithms exist for directed graphs, though these do n
eory, but focus more specifically on routing algorithms for optical networks and collective communic
arge amount of literature on polynomial-time algorithms for certain special classes of discrete opti
and helped to introduce the use of streaming algorithms for network measurement and security at spee
However, there exist several algorithms for processing trees so that lowest common a
s was placed on the development of efficient algorithms for operations with orthogonal polygons, sin
plete, but despite this hardness result many algorithms for finding cliques have been studied.

1 2 3 次へ＞