Sciweavers

942 search results - page 84 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
TIT
2010
141views Education» more  TIT 2010»
13 years 4 months ago
Distributed averaging via lifted Markov chains
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
Kyomin Jung, Devavrat Shah, Jinwoo Shin
ECCC
2006
145views more  ECCC 2006»
13 years 10 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
PODS
1999
ACM
160views Database» more  PODS 1999»
14 years 2 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
EMMCVPR
2003
Springer
14 years 3 months ago
Generalized Multi-camera Scene Reconstruction Using Graph Cuts
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
Vladimir Kolmogorov, Ramin Zabih, Steven J. Gortle...
IPPS
2009
IEEE
14 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker