4894 search results - page 633 / 979 » The Guarding Problem - Complexity and Approximation |
130
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
140
click to vote
AAAI
2007
15 years 6 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
142
Voted
IJCAI
2007
15 years 5 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
140
Voted
TON
2010
15 years 2 months ago
2010
—We develop analytical models to characterize pricing of spectrum rights in cellular CDMA networks. Specifically, we consider a primary license holder that aims to lease its spe...
131
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Recent studies have revealed the importance of considering the entire distribution of possible secondary structures in RNA secondary structure predictions; therefore, ...