Sciweavers

2570 search results - page 154 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
119
Voted
SOFSEM
2010
Springer
16 years 9 days ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
128
Voted
IEAAIE
2003
Springer
15 years 8 months ago
Fast Feature Selection by Means of Projections
The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simple...
Roberto Ruiz, José Cristóbal Riquelm...
117
Voted
DAC
2005
ACM
15 years 5 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
JCB
2007
168views more  JCB 2007»
15 years 3 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
121
Voted
EMMCVPR
2003
Springer
15 years 8 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri