Sciweavers

3475 search results - page 514 / 695
» Backbones in Optimization and Approximation
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 7 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
NIPS
2003
15 years 7 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
UAI
2003
15 years 7 months ago
Bayesian Hierarchical Mixtures of Experts
The Hierarchical Mixture of Experts (HME) is a well-known tree-structured model for regression and classification, based on soft probabilistic splits of the input space. In its o...
Christopher M. Bishop, Markus Svensén
ICASSP
2010
IEEE
15 years 6 months ago
A parallel point-process filter for estimation of goal-directed movements from neural signals
Brain machine interfaces work by mapping the relevant neural activity to the intended movement known as ‘decoding’. Here, we develop a recursive Bayesian decoder for goaldirec...
Maryam Modir Shanechi, Gregory W. Wornell, Ziv Wil...
AI
2008
Springer
15 years 6 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith