Sciweavers

692 search results - page 72 / 139
» BDD minimization for approximate computing
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 4 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
NCA
2009
IEEE
15 years 5 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu
MIAR
2006
IEEE
15 years 5 months ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
Tommy W. H. Tang, Albert C. S. Chung
JSSPP
2005
Springer
15 years 4 months ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
VC
2010
134views more  VC 2010»
14 years 9 months ago
Detail-driven digital hologram generation
Abstract Digital holography is a technology with a potential to provide realistic 3D images. However, generation of digital holograms is a computationally demanding task. Thus, the...
Ivo Hanák, Martin Janda, Václav Skal...