Sciweavers

1723 search results - page 312 / 345
» Cycling in linear programming problems
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 8 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
PR
2006
102views more  PR 2006»
13 years 8 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
TIP
2008
175views more  TIP 2008»
13 years 8 months ago
Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
Aswin C. Sankaranarayanan, Ankur Srivastava, Rama ...
TPDS
2008
72views more  TPDS 2008»
13 years 8 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
TSP
2008
166views more  TSP 2008»
13 years 8 months ago
A Convex Analysis Framework for Blind Separation of Non-Negative Sources
This paper presents a new framework for blind source separation (BSS) of non-negative source signals. The proposed framework, referred herein to as convex analysis of mixtures of ...
Tsung-Han Chan, Wing-Kin Ma, Chong-Yung Chi, Yue W...