Sciweavers

312 search results - page 31 / 63
» Problem Structure in the Presence of Perturbations
Sort
View
160
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 6 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
NIPS
2008
15 years 7 months ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil
IJCV
2006
115views more  IJCV 2006»
15 years 6 months ago
An Analysis of Linear Subspace Approaches for Computer Vision and Pattern Recognition
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
Pei Chen, David Suter
SRDS
2010
IEEE
15 years 3 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
TSP
2010
15 years 23 days ago
Single antenna power measurements based direction finding
Abstract--In this paper, the problem of estimating direction-ofarrival (DOA) of multiple uncorrelated sources from single antenna power measurements is addressed. Utilizing the fac...
Joni Polili Lie, Thierry Blu, Chong Meng Samson Se...