Sciweavers

3652 search results - page 352 / 731
» A study of query length
Sort
View
MST
2006
149views more  MST 2006»
15 years 3 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
ECCC
2011
207views ECommerce» more  ECCC 2011»
14 years 11 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
CHI
2011
ACM
14 years 7 months ago
Tag clouds and keyword clouds: evaluating zero-interaction benefits
Tag clouds are typically presented so that users can actively utilize community-generated metadata to query a collection. This research investigates whether such keyword clouds, a...
Mathew J. Wilson, Max L. Wilson
131
Voted
WWW
2008
ACM
16 years 4 months ago
Sailer: an effective search engine for unified retrieval of heterogeneous xml and web documents
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...
Guoliang Li, Jianhua Feng, Jianyong Wang, Xiaoming...
164
Voted
WWW
2008
ACM
16 years 4 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...