Sciweavers

229 search results - page 39 / 46
» Dynamic Algorithms for Recoverable Robustness Problems
Sort
View
AMDO
2006
Springer
13 years 10 months ago
Collision Detection Trough Deconstruction of Articulated Objects
Abstract. Many applications in computer graphics require fast and robust collision detection algorithms. The problem of simulating motion in an articulated chain has been well stud...
Roberto Therón, Vidal Moreno, Belén ...
INFOCOM
2007
IEEE
14 years 1 months ago
On Optimal MAC Scheduling With Physical Interference
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
14 years 1 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
ICIP
2003
IEEE
14 years 8 months ago
Transductive inference for color-based particle filter tracking
Robust real-time tracking of non-rigid objects in a dynamic environment is a challenging task. Among various cues in tracking, color can provide an efficient visual cue for this t...
Jiang Li, Chin-Seng Chua
LFP
1990
73views more  LFP 1990»
13 years 7 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.