2107 search results - page 223 / 422 » Computing Small Search Numbers in Linear Time |
111
click to vote
INFOVIS
2005
IEEE
15 years 8 months ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
124
Voted
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
146
Voted
ISCI
2007
15 years 2 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
138
click to vote
TALG
2008
15 years 2 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
140
click to vote
MM
2004
ACM
15 years 8 months ago
2004
ACM
Most current image retrieval systems and commercial search engines use mainly text annotations to index and retrieve WWW images. This research explores the use of machine learning...