Sciweavers

4860 search results - page 834 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
WWW
2005
ACM
16 years 6 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
WWW
2005
ACM
16 years 6 months ago
Ranking a stream of news
According to a recent survey made by Nielsen NetRatings, searching on news articles is one of the most important activity online. Indeed, Google, Yahoo, MSN and many others have p...
Gianna M. Del Corso, Antonio Gulli, Francesco Roma...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 6 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 6 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
RECOMB
2005
Springer
16 years 6 months ago
RNA-RNA Interaction Prediction and Antisense RNA Target Search
Abstract. Recent studies demonstrating the existence of special non-coding "antisense" RNAs used in post-transcriptional gene regulation have received considerable attent...
Can Alkan, Emre Karakoç, Joseph H. Nadeau, ...