Sciweavers

4894 search results - page 634 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
TSP
2010
14 years 10 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
MOBIHOC
2009
ACM
16 years 4 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
MLG
2007
Springer
15 years 10 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
ACIVS
2006
Springer
15 years 10 months ago
Visibility of Point Clouds and Mapping of Unknown Environments
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
Yanina Landa, Richard Tsai, Li-Tien Cheng
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...