3360 search results - page 497 / 672 » Opportunistic Data Structures with Applications |
253
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
173
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
136
click to vote
TASLP
2008
15 years 4 months ago
2008
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...
170
click to vote
ISBI
2009
IEEE
15 years 11 months ago
2009
IEEE
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...
155
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determi...