995 search results - page 97 / 199 » complexity 2011 |
196
Voted
APVIS
2011
14 years 3 months ago
2011
NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...
184
Voted
COMPSYSTECH
2011
14 years 3 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
148
Voted
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
172
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
238
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...