Sciweavers

897 search results - page 173 / 180
» Identity: How to name it, How to find it
Sort
View
SIGSOFT
2007
ACM
16 years 12 days ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
WWW
2006
ACM
16 years 10 days ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 2 days ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
RECOMB
2005
Springer
15 years 12 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, ...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 11 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...