32545 search results - page 332 / 6509 » Data Structures and Algorithms |
179
Voted
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
165
Voted
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
174
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
176
click to vote
HIM
1997
Springer
15 years 11 months ago
1997
Springer
The application of information retrieval techniques in interactive environments requires systems capable of efficiently processing vague queries. To reach reasonable response tim...
204
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...