Sciweavers

7259 search results - page 5 / 1452
» From Fields to Trees
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
COMGEO
2010
ACM
13 years 8 months ago
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
our tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scala...
Hamish Carr, Jack Snoeyink, Michiel van de Panne
GIS
2005
ACM
14 years 9 months ago
In-network surface simplification for sensor fields
Recent research literature on sensor network databases has focused on finding ways to perform in-network aggregation of sensor readings to reduce the message cost. However, with t...
Brian Harrington, Yan Huang
BILDMED
2009
162views Algorithms» more  BILDMED 2009»
13 years 9 months ago
Extracting a Purely Non-rigid Deformation Field of a Single Structure
During endovascular aortic repair (EVAR) treatment, the aortic shape is subject to severe deformation that is imposed by medical instruments such as guide wires, catheters, and the...
Stefanie Demirci, Frode Manstad-Hulaas, Nassir Nav...
DSD
2007
IEEE
160views Hardware» more  DSD 2007»
14 years 2 months ago
Alternatives in Designing Level-Restoring Buffers for Interconnection Networks in Field-Programmable Gate Arrays
Programmable routing and logic in field-programmable gate arrays are implemented using nMOS pass transistors. Since the threshold voltage drop across an nMOS device degrades the ...
Scott Miller, Mihai Sima, Michael McGuire