Sciweavers

376 search results - page 73 / 76
» Betweenness Centrality : Algorithms and Lower Bounds
Sort
View
TIP
1998
128views more  TIP 1998»
14 years 9 months ago
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
Antonin Chambolle, Ronald A. DeVore, Nam-Yong Lee,...
FOCS
2008
IEEE
15 years 3 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
ECCV
2008
Springer
15 years 11 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
SIGSOFT
2004
ACM
15 years 10 months ago
Merging partial behavioural models
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
Marsha Chechik, Sebastián Uchitel
86
Voted
PODS
2008
ACM
128views Database» more  PODS 2008»
15 years 9 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren