Sciweavers

478 search results - page 61 / 96
» Approximation algorithms for general packing problems and th...
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
ICRA
2009
IEEE
100views Robotics» more  ICRA 2009»
13 years 6 months ago
Multi-robot plan adaptation by constrained minimal distortion feature mapping
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
Bálint Takács, Yiannis Demiris
ACMACE
2005
ACM
14 years 2 months ago
Achieving fairness in multiplayer network games through automated latency balancing
Over the past few years, the prominence of multiplayer network gaming has increased dramatically in the Internet. The effect of network delay (lag) on multiplayer network gaming h...
Sebastian Zander, Ian Leeder, Grenville J. Armitag...
MM
2004
ACM
98views Multimedia» more  MM 2004»
14 years 2 months ago
Coordinated multi-streaming for 3D tele-immersion
This paper looks at the problem of multi-streaming in 3D teleimmersion and describes how a protocol architecture called CP (for Coordination Protocol) can be used to coordinate vi...
David E. Ott, Ketan Mayer-Patel
ECML
2005
Springer
14 years 2 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen