Sciweavers

518 search results - page 47 / 104
» Beating a Random Assignment
Sort
View
COR
2004
127views more  COR 2004»
15 years 2 months ago
Towards the real time solution of strike force asset allocation problems
The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximiz...
Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd
113
Voted
RSA
2002
87views more  RSA 2002»
15 years 2 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
SPAA
2010
ACM
15 years 7 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 8 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
123
Voted
ECCV
2006
Springer
16 years 4 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock