Sciweavers

1133 search results - page 164 / 227
» Basics of Graph Cuts
Sort
View
IPMI
2005
Springer
16 years 3 months ago
Analysis of Event-Related fMRI Data Using Diffusion Maps
The blood oxygen level-dependent (BOLD) signal in response to brief periods of stimulus can be detected using event-related functional magnetic resonance imaging (ER-fMRI). In this...
François G. Meyer, Xilin Shen
MOBIHOC
2005
ACM
16 years 2 months ago
Hybrid sensor networks: a small world
In this paper, we investigate the use of limited infrastructure, in the form of wires, for improving the energy efficiency of a wireless sensor network. We call such a sensor netw...
Gaurav Sharma, Ravi Mazumdar
CVPR
2010
IEEE
15 years 10 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 9 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
CRV
2008
IEEE
165views Robotics» more  CRV 2008»
15 years 9 months ago
Hierarchical Stereo with Thin Structures and Transparency
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
Mikhail Sizintsev