Sciweavers

79 search results - page 9 / 16
» Biased Skip Lists
Sort
View
92
Voted
SPAA
2005
ACM
15 years 3 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
177
Voted
SIGIR
2011
ACM
14 years 9 days ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
PKDD
2007
Springer
102views Data Mining» more  PKDD 2007»
15 years 3 months ago
Towards Data Mining Without Information on Knowledge Structure
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
Alexandre Vautier, Marie-Odile Cordier, Rene Quini...
ICML
2009
IEEE
15 years 10 months ago
Partially supervised feature selection with regularized linear models
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
Thibault Helleputte, Pierre Dupont
SEMWEB
2004
Springer
15 years 2 months ago
How to Build Google2Google - An (Incomplete) Recipe
Abstract. This talk explores aspects relevant for peer-to-peer search infrastructures, which we think are better suited to semantic web search than centralized approaches. It does ...
Wolfgang Nejdl