Results 1  10
of
94,308
Parameterized singleexponential time polynomial space algorithm for Steiner Tree
"... In the Steiner tree problem, we are given as input a connected nvertex graph with edge weights in {1, 2,...,W}, and a subset of k terminal vertices. Our task is to compute a minimumweight tree that contains all the terminals. We give an algorithm for this problem with running time O(7.97k ·n4 · ..."
Abstract
 Add to MetaCart
· log W) using O(n3 · log nW · log k) space. This is the first singleexponential time, polynomialspace FPT algorithm for the weighted Steiner Tree problem.
Solving connectivity problems parameterized by treewidth in single exponential time (Extended Abstract)
, 2011
"... For the vast majority of local problems on graphs of small treewidth (where by local we mean that a solution can be verified by checking separately the neighbourhood of each vertex), standard dynamic programming techniques give c tw V  O(1) time algorithms, where tw is the treewidth of the input g ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
on planar and Hminorfree graphs and exact algorithms on graphs of bounded degree. The constant c in our algorithms is in all cases small, and in several cases we are able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail. In contrast to the problems aiming
Computing the first few Betti numbers of semialgebraic sets in single exponential time
, 2006
"... In this paper we describe an algorithm that takes as input a description of a semialgebraic set S ⊂ Rk, defined by a Boolean formula with atoms of the form P> 0,P < 0,P = 0 for P ∈ P ⊂ R[X1,...,Xk], and outputs the first ℓ + 1 Betti numbers of S, b0(S),...,bℓ(S). The complexity of the algorith ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
of the algorithm is (sd) kO(ℓ), where where s = #(P) and d = maxP ∈P deg(P), which is singly exponential in k for ℓ any fixed constant. Previously, singly exponential time algorithms were known only for computing the EulerPoincaré characteristic, the zeroth and the first Betti numbers.
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations.
 In STOC,
, 2010
"... ABSTRACT We give deterministicÕ(2 2n+o(n) )time algorithms to solve all the most important computational problems on point lattices in NP, including the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), and Shortest Independent Vectors Problem (SIVP). This improves the n O(n) running ti ..."
Abstract

Cited by 62 (3 self)
 Add to MetaCart
ABSTRACT We give deterministicÕ(2 2n+o(n) )time algorithms to solve all the most important computational problems on point lattices in NP, including the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), and Shortest Independent Vectors Problem (SIVP). This improves the n O(n) running
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
to the language L. It was previously suspected (and proved in a relativized sense) that coNPcomplete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having twoprover interactive proof systems is nondeterministic exponential time. After the recent results
Realtime human pose recognition in parts from single depth images
 IN CVPR
, 2011
"... We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler p ..."
Abstract

Cited by 568 (17 self)
 Add to MetaCart
We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3756 (3 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
Robust realtime face detection
 International Journal of Computer Vision
, 2004
"... We have constructed a frontal face detection system which achieves detection and false positive rates which are equivalent to the best published results [7, 5, 6, 4, 1]. This face detection system is most clearly distinguished from previous approaches in its ability to detect faces extremely rapidly ..."
Abstract

Cited by 1888 (9 self)
 Add to MetaCart
rates. Our system achieves high frame rates working only with the information present in a single grey scale image. These alternative sources of information can also be integrated with our system to achieve even higher frame rates.
MonoSLAM: Realtime single camera SLAM
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2007
"... Abstract—We present a realtime algorithm which can recover the 3D trajectory of a monocular camera, moving rapidly through a previously unknown scene. Our system, which we dub MonoSLAM, is the first successful application of the SLAM methodology from mobile robotics to the “pure vision ” domain of ..."
Abstract

Cited by 490 (26 self)
 Add to MetaCart
of a single uncontrolled camera, achieving real time but driftfree performance inaccessible to Structure from Motion approaches. The core of the approach is the online creation of a sparse but persistent map of natural landmarks within a probabilistic framework. Our key novel contributions include
Results 1  10
of
94,308