3656 search results - page 35 / 732 » Compact Location Problems |
133
click to vote
SIGECOM
2011
ACM
14 years 3 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
131
click to vote
WWW
2008
ACM
16 years 1 months ago
2008
ACM
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
109
click to vote
PODS
2001
ACM
16 years 27 days ago
2001
ACM
Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML docum...
103
click to vote
ICCV
2001
IEEE
16 years 2 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
106
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...