Sciweavers

1019 search results - page 112 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 9 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ICRA
2009
IEEE
169views Robotics» more  ICRA 2009»
14 years 3 months ago
Manipulation planning with Workspace Goal Regions
— We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goa...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
ICCV
2003
IEEE
14 years 10 months ago
A Sparse Probabilistic Learning Algorithm for Real-Time Tracking
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
Oliver M. C. Williams, Andrew Blake, Roberto Cipol...
APCCAS
2002
IEEE
156views Hardware» more  APCCAS 2002»
14 years 1 months ago
Bit-plane watermarking for zerotree-coded images
In this paper, we develop a robust bit-plane watermarking technique based on zerotree coding. A robust watermark is an imperceptible but indelible code that can be used for owners...
Shih-Hsuan Yang, Hsin-Chang Chen
PAMI
2008
215views more  PAMI 2008»
13 years 8 months ago
Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-co...
Brent C. Munsell, Pahal Dalal, Song Wang