Sciweavers

692 search results - page 18 / 139
» BDD minimization for approximate computing
Sort
View
EMMCVPR
2001
Springer
15 years 6 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
ADHOCNOW
2009
Springer
15 years 3 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 7 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
PG
1999
IEEE
15 years 6 months ago
Mesh Approximation Using a Volume-Based Metric
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and th...
Pierre Alliez, Nathalie Laurent, Henri Sanson, Fra...
SIGGRAPH
1992
ACM
15 years 6 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder