Sciweavers

2822 search results - page 326 / 565
» Global Optimization of Histograms
Sort
View
NIPS
2001
15 years 7 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
NIPS
2003
15 years 7 months ago
Salient Boundary Detection using Ratio Contour
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
Song Wang, Toshiro Kubota, Jeffrey Mark Siskind
CGF
2006
177views more  CGF 2006»
15 years 6 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
CCE
2005
15 years 6 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
TPDS
2002
104views more  TPDS 2002»
15 years 5 months ago
Composite Synchronization in Parallel Discrete-Event Simulation
This paper considers a technique for composing global (barrier-style) and local (channel scanning) synchronization protocols within a single parallel discrete-event simulation. Com...
David M. Nicol, Jason Liu