Sciweavers

417 search results - page 68 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 8 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 8 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
ROBOCOMM
2007
IEEE
14 years 1 months ago
Distributed adaptive sampling using bounded-errors
—This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. O...
Kévin Huguenin, Maria-João Rendas
ATAL
2007
Springer
14 years 1 months ago
Average-case tractability of manipulation in voting via the fraction of manipulators
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ISPA
2004
Springer
14 years 22 days ago
An Enhanced Message Exchange Mechanism in Cluster-Based Mobile Ad Hoc Networks
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
Wei Lou, Jie Wu