Sciweavers

1451 search results - page 125 / 291
» Finding People by Sampling
Sort
View
SDM
2004
SIAM
174views Data Mining» more  SDM 2004»
15 years 6 months ago
Classifying Documents Without Labels
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform classif...
Daniel Barbará, Carlotta Domeniconi, Ning K...
BMCBI
2008
78views more  BMCBI 2008»
15 years 5 months ago
Deducing topology of protein-protein interaction networks from experimentally measured sub-networks
Background: Protein-protein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallym...
Ling Yang, Thomas M. Vondriska, Zhangang Han, W. R...
137
Voted
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 5 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
ICML
2010
IEEE
15 years 6 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
147
Voted
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
15 years 5 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng