Sciweavers

161 search results - page 10 / 33
» Counting Distinct Strings
Sort
View
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
14 years 2 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
NAR
2007
65views more  NAR 2007»
13 years 8 months ago
STRING 7 - recent developments in the integration and prediction of protein interactions
Information on protein–protein interactions is still mostly limited to a small number of model organisms, and originates from a wide variety of experimental and computational te...
Christian von Mering, Lars Juhl Jensen, Michael Ku...
CIKM
2006
Springer
14 years 8 days ago
3DString: a feature string kernel for 3D object classification on voxelized data
Classification of 3D objects remains an important task in many areas of data management such as engineering, medicine or biology. As a common preprocessing step in current approac...
Johannes Aßfalg, Karsten M. Borgwardt, Hans-...
ALGOSENSORS
2008
Springer
13 years 10 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
ICFP
2010
ACM
13 years 9 months ago
Functional pearl: every bit counts
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
Dimitrios Vytiniotis, Andrew Kennedy