Sciweavers

2496 search results - page 431 / 500
» On covering by translates of a set
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 1 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
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...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
IDA
2007
Springer
15 years 1 months ago
Removing biases in unsupervised learning of sequential patterns
Unsupervised sequence learning is important to many applications. A learner is presented with unlabeled sequential data, and must discover sequential patterns that characterize th...
Yoav Horman, Gal A. Kaminka
SIGIR
2008
ACM
15 years 1 months ago
A study of methods for negative relevance feedback
Negative relevance feedback is a special case of relevance feedback where we do not have any positive example; this often happens when the topic is difficult and the search result...
Xuanhui Wang, Hui Fang, ChengXiang Zhai
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 1 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
125
Voted
TALG
2008
152views more  TALG 2008»
15 years 1 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...