Sciweavers

3918 search results - page 305 / 784
» Probabilistic model of triangulation
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
16 years 1 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
PG
2003
IEEE
16 years 2 hour ago
Hierarchical Least Squares Conformal Map
A texture atlas is an efficient way to represent information (like colors, normals, displacement maps ...) on triangulated surfaces. The LSCM method (Least Squares Conformal Maps...
Nicolas Ray, Bruno Lévy
IJBC
2008
112views more  IJBC 2008»
15 years 6 months ago
Computation and Visualization of bifurcation Surfaces
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
Dirk Stiefs, Thilo Gross, Ralf Steuer, Ulrike Feud...
PVLDB
2008
122views more  PVLDB 2008»
15 years 6 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 8 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi