Sciweavers

1604 search results - page 274 / 321
» Regularization on Discrete Spaces
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 23 days ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
126
Voted
EUROGRAPHICS
2010
Eurographics
16 years 13 days ago
Seamless Montage for Texturing Models
We present an automatic method to recover high-resolution texture over an object by mapping detailed photographs onto its surface. Such high-resolution detail often reveals inaccu...
Ran Gal, Yonatan Wexler, Eyal Ofek, Hugues Hoppe, ...
ICPR
2010
IEEE
15 years 10 months ago
Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...
PERCOM
2009
ACM
15 years 10 months ago
Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
Chinh T. Vu, Yingshu Li
SAC
2009
ACM
15 years 10 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...