Sciweavers

2229 search results - page 351 / 446
» Comparative analysis of biclustering algorithms
Sort
View
WWW
2004
ACM
16 years 3 months ago
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
Christoph Tempich, Steffen Staab, Adrian Wranik
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 3 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
244
Voted
POPL
2007
ACM
16 years 3 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
RECOMB
2006
Springer
16 years 3 months ago
Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...
Sagi Snir, Lior Pachter
SIGMOD
2005
ACM
74views Database» more  SIGMOD 2005»
16 years 3 months ago
Online B-tree Merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
Xiaowei Sun, Rui Wang 0002, Betty Salzberg, Chendo...