Sciweavers

2542 search results - page 487 / 509
» One step ahead
Sort
View
ECCC
2007
90views more  ECCC 2007»
13 years 10 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
JMLR
2006
85views more  JMLR 2006»
13 years 10 months ago
Streamwise Feature Selection
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...
PAMI
2008
220views more  PAMI 2008»
13 years 10 months ago
Pedestrian Detection via Classification on Riemannian Manifolds
Detecting different categories of objects in image and video content is one of the fundamental tasks in computer vision research. The success of many applications such as visual s...
Oncel Tuzel, Fatih Porikli, Peter Meer
PR
2008
100views more  PR 2008»
13 years 10 months ago
Boundary based shape orientation
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
Jovisa D. Zunic, Milos Stojmenovic
IJAR
2007
96views more  IJAR 2007»
13 years 10 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang