Sciweavers

6365 search results - page 1018 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2010
IEEE
15 years 7 months ago
A probabilistic framework for joint segmentation and tracking
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
Chad Aeschliman, Johnny Park, Avinash C. Kak
TOG
2002
234views more  TOG 2002»
15 years 6 months ago
Gradient domain high dynamic range compression
We present a new method for rendering high dynamic range images on conventional displays. Our method is conceptually simple, computationally efficient, robust, and easy to use. We...
Raanan Fattal, Dani Lischinski, Michael Werman
JPDC
2010
137views more  JPDC 2010»
15 years 5 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna
DAS
2010
Springer
15 years 4 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
IPPS
2010
IEEE
15 years 4 months ago
Hypergraph-based task-bundle scheduling towards efficiency and fairness in heterogeneous distributed systems
This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...
Han Zhao, Xinxin Liu, Xiaolin Li
« Prev « First page 1018 / 1273 Last » Next »