Sciweavers

681 search results - page 85 / 137
» Searching with expectations
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 4 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
ISMB
2004
15 years 1 months ago
Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy
Motivation: Non-coding RNAs (ncRNAs)--functional RNA molecules not coding for proteins--are grouped into hundreds of families of homologs. To find new members of an ncRNA gene fam...
Zasha Weinberg, Walter L. Ruzzo
AAAI
1994
15 years 1 months ago
High Dimension Action Spaces in Robot Skill Learning
Table lookup with interpolation is used for many learning and adaptation tasks. Redundant mappings capture the important concept of \motor skill," which is important in real,...
Jeff G. Schneider
CIKM
2007
Springer
15 years 6 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
WWW
2011
ACM
14 years 6 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh