Sciweavers

2746 search results - page 489 / 550
» Bisubmodular Function Minimization
Sort
View
COLT
2008
Springer
13 years 10 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
DAGM
2008
Springer
13 years 10 months ago
Convex Hodge Decomposition of Image Flows
The total variation (TV) measure is a key concept in the field of variational image analysis. Introduced by Rudin, Osher and Fatemi in connection with image denoising, it also prov...
Jing Yuan, Gabriele Steidl, Christoph Schnörr
DAGM
2008
Springer
13 years 10 months ago
Resolution Enhancement of PMD Range Maps
Photonic mixer device (PMD) range cameras are becoming popular as an alternative to algorithmic 3D reconstruction but their main drawbacks are low-resolution (LR) and noise. Recent...
A. N. Rajagopalan, Arnav V. Bhavsar, Frank Wallhof...
DCOSS
2008
Springer
13 years 10 months ago
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
Hany Morcos, George Atia, Azer Bestavros, Ibrahim ...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 10 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz