Sciweavers

2192 search results - page 149 / 439
» Algorithms for Challenging Motif Problems
Sort
View
110
Voted
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
15 years 8 months ago
OVSF-CDMA code assignment in wireless ad hoc networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
117
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
150
Voted
NIPS
2003
15 years 4 months ago
Factorization with Uncertainty and Missing Data: Exploiting Temporal Coherence
The problem of “Structure From Motion” is a central problem in vision: given the 2D locations of certain points we wish to recover the camera motion and the 3D coordinates of ...
Amit Gruber, Yair Weiss
125
Voted
ATAL
2007
Springer
15 years 9 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
115
Voted
FITRAMEN
2008
15 years 4 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier