4860 search results - page 335 / 972 » SNPs Problems, Complexity, and Algorithms |
112
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
127
click to vote
COSIT
1995
Springer
15 years 7 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
158
Voted
ISCAS
2011
IEEE
14 years 7 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
120
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
93
Voted
NIPS
2003
15 years 4 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...