3946 search results - page 149 / 790 » The computational complexity of choice sets |
196
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
161
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We evaluate three different relevance feedback (RF) algorithms, Rocchio, Robertson/Sparck-Jones (RSJ) and Bayesian, in the context of Web search. We use a target-testing experimen...
173
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
206
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
198
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...