Sciweavers

545 search results - page 87 / 109
» Global Register Partitioning
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun
MATES
2009
Springer
14 years 3 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
RTCSA
2008
IEEE
14 years 3 months ago
Power-Aware Data Buffer Cache Management in Real-Time Embedded Databases
The demand for real-time data services in embedded systems is increasing. In these new computing platforms, using traditional buffer management schemes, whose goal is to minimize ...
Woochul Kang, Sang Hyuk Son, John A. Stankovic
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
14 years 3 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
SMI
2007
IEEE
208views Image Analysis» more  SMI 2007»
14 years 2 months ago
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
Yi-Ling Chen, Shang-Hong Lai