Sciweavers

4117 search results - page 481 / 824
» On the Satisfiability of Complex Constraints
Sort
View
JVCA
2007
128views more  JVCA 2007»
15 years 6 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
COMCOM
2004
111views more  COMCOM 2004»
15 years 6 months ago
An adaptive scheduling algorithm for differentiated services on WDM optical networks
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
Maode Ma, Mounir Hamdi
TVCG
2002
109views more  TVCG 2002»
15 years 6 months ago
Robust Creation of Implicit Surfaces from Polygonal Meshes
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
Gary D. Yngve, Greg Turk
PVLDB
2008
107views more  PVLDB 2008»
15 years 5 months ago
Constrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
Hao Cheng, Kien A. Hua, Khanh Vu
PAMI
2010
241views more  PAMI 2010»
15 years 1 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song