2107 search results - page 265 / 422 » Computing Small Search Numbers in Linear Time |
103
Voted
SAC
2005
ACM
15 years 8 months ago
2005
ACM
Search engines crawl and index webpages depending upon their informative content. However, webpages — especially dynamically generated ones — contain items that cannot be clas...
137
Voted
ISMB
2000
15 years 3 months ago
2000
Mycobacterium tuberculosis (M. tb.) strains differ in the number and locations of a transposon-like insertion sequence known as IS6110. Accurate detection of this sequence can be ...
144
Voted
ICPP
2006
IEEE
15 years 8 months ago
2006
IEEE
— Resource discovery is the process of locating shared resources on a computer network. Previously studied examples include efficiently finding files with a given title on a ...
134
Voted
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
148
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...