Sciweavers

414 search results - page 66 / 83
» A parallel extended GCD algorithm
Sort
View
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
14 years 9 months ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
AAAI
2006
13 years 9 months ago
Collective Construction Using Lego Robots
hibition: Extended Abstract Social insects, such as ants and termites, collectively build large and complex structures, with many individuals following simple rules and no centrali...
Crystal Schuil, Matthew Valente, Justin Werfel, Ra...
CVPR
2001
IEEE
14 years 9 months ago
Automatic Partitioning of High Dimensional Search Spaces Associated with Articulated Body Motion Capture
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
Jonathan Deutscher, Andrew J. Davison, Ian D. Reid
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
13 years 11 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang