Sciweavers

441 search results - page 66 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
DAGM
2008
Springer
14 years 11 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
INFOCOM
2003
IEEE
15 years 3 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
SIAMJO
2010
246views more  SIAMJO 2010»
14 years 8 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
INFOCOM
2000
IEEE
15 years 2 months ago
Blocking in All-Optical Networks
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Ashwin Sridharan, Kumar N. Sivarajan
CVPR
2009
IEEE
16 years 5 months ago
Learning color and locality cues for moving object detection and segmentation
This paper presents an algorithm for automatically detecting and segmenting a moving object from a monocular video. Detecting and segmenting a moving object from a video with limit...
Feng Liu (University of Wisconsin-Madison), Michae...