Sciweavers

663 search results - page 123 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
PAMI
2011
13 years 2 months ago
Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
Daniel Cremers, Kalin Kolev
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Adding Depth to Cartoons Using Sparse Depth (In)equalities
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
Daniel Sýkora, David Sedlacek, Sun Jinchao, John ...
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
MASS
2010
119views Communications» more  MASS 2010»
13 years 5 months ago
Energy-efficient data redistribution in sensor networks
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
Bin Tang, Neeraj Jaggi, Haijie Wu, Rohini Kurkal
ICALP
2004
Springer
14 years 26 days ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella