1424 search results - page 68 / 285 » The Multi-radius Cover Problem |
107
Voted
ICML
1998
IEEE
15 years 4 months ago
1998
IEEE
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...
89
Voted
PERCOM
2009
ACM
15 years 7 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
122
click to vote
IPCO
2007
15 years 2 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
PKDD
2007
Springer
15 years 7 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
117
click to vote
COLING
2008
15 years 2 months ago
2008
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...