Sciweavers

2596 search results - page 476 / 520
» Classes and clusters in data analysis
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 11 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
SIGIR
2006
ACM
15 years 10 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
BMCBI
2010
173views more  BMCBI 2010»
15 years 4 months ago
The Yeast Resource Center Public Image Repository: A large database of fluorescence microscopy images
Background: There is increasing interest in the development of computational methods to analyze fluorescent microscopy images and enable automated large-scale analysis of the subc...
Michael Riffle, Trisha N. Davis
SCL
2011
14 years 6 months ago
Regularity issues for the null-controllability of the linear 1-d heat equation
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
Sorin Micu, Enrique Zuazua
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel