15033 search results - page 335 / 3007 » Complexity Theory and Algorithms |
172
click to vote
MLG
2007
Springer
16 years 12 days ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
134
click to vote
CEC
2005
IEEE
15 years 12 months ago
2005
IEEE
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
154
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
161
click to vote
COCO
1998
Springer
15 years 10 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
184
click to vote
TALG
2010
15 years 1 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...