807 search results - page 89 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
126
click to vote
WSCG
2004
15 years 5 months ago
2004
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
121
click to vote
APBC
2004
15 years 5 months ago
2004
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
140
click to vote
CN
1998
15 years 3 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
151
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
130
click to vote
DAC
2001
ACM
16 years 4 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...