2434 search results - page 216 / 487 » Algorithmic Randomness of Closed Sets |
125
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
137
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...
140
click to vote
JISE
2008
15 years 4 months ago
2008
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
166
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
133
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...