Sciweavers

465 search results - page 62 / 93
» On the Hardness of Range Assignment Problems
Sort
View
SSDBM
2007
IEEE
116views Database» more  SSDBM 2007»
15 years 6 months ago
A Distributed Algorithm for Joins in Sensor Networks
Given their autonomy, flexibility and large range of functionality, wireless sensor networks can be used as an effective and discrete means for monitoring data in many domains. T...
Alexandru Coman, Mario A. Nascimento
74
Voted
AIPS
2000
15 years 1 months ago
Mixed-Initiative Resource Management: The AMC Barrel Allocator
In this paper, we describe the Barrel Allocator, a scheduling tool developed for day-to-day allocation and management of airlift and tanker resources at the USAF Air Mobility Comm...
Marcel A. Becker, Stephen F. Smith
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 15 days ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
SIGIR
2009
ACM
15 years 6 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra