400 search results - page 25 / 80 » Derandomization and Distinguishing Complexity |
131
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
115
click to vote
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
118
click to vote
SGP
2004
15 years 4 months ago
2004
In this paper, we initiate a study of shape description and classification via the application of persistent homology to tangential constructions on geometric objects. Our techniq...
119
click to vote
ICWS
2004
IEEE
15 years 3 months ago
2004
IEEE
Service composition refers to the aggregation of services to build complex applications to achieve client requirements. It is an important challenge to make it possible for users ...
129
click to vote
ICIP
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper presents a low cost real-time alternative to available commercial human motion capture systems. First, a set of distinguishable markers are placed on several human body...