Sciweavers

2168 search results - page 319 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
135
Voted
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
16 years 3 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 8 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
BMCBI
2008
153views more  BMCBI 2008»
15 years 3 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 15 days ago
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-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
101
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Shape Segmentation and Applications in Sensor Networks
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
Xianjin Zhu, Rik Sarkar, Jie Gao