Sciweavers

2432 search results - page 300 / 487
» Degrees and choice numbers
Sort
View
DAM
2008
140views more  DAM 2008»
15 years 6 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
ML
2007
ACM
127views Machine Learning» more  ML 2007»
15 years 6 months ago
Density estimation with stagewise optimization of the empirical risk
We consider multivariate density estimation with identically distributed observations. We study a density estimator which is a convex combination of functions in a dictionary and ...
Jussi Klemelä
MST
2007
168views more  MST 2007»
15 years 6 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
TSP
2008
134views more  TSP 2008»
15 years 6 months ago
A Mapping-Based Design for Nonsubsampled Hourglass Filter Banks in Arbitrary Dimensions
Multidimensional hourglass filter banks decompose the frequency spectrum of input signals into hourglass-shaped directional subbands, each aligned with one of the frequency axes. T...
Yue M. Lu, Minh N. Do
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
15 years 5 months ago
Variable resolution decomposition for robotic navigation under a POMDP framework
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
Robert Kaplow, Amin Atrash, Joelle Pineau