Results 11  20
of
2,393,104
Improved Exponentialtime Algorithms for InhomogeneousSIS
"... Abstract. The paper is about algorithms for the inhomogeneous short integer solution problem: Given (A,b) to find a short vector s such that As ≡ b (mod q). We consider algorithms for this problem due to Camion and Patarin; Wagner; Schroeppel and Shamir; HowgraveGraham and Joux; Becker, Coron and J ..."
Abstract
 Add to MetaCart
Abstract. The paper is about algorithms for the inhomogeneous short integer solution problem: Given (A,b) to find a short vector s such that As ≡ b (mod q). We consider algorithms for this problem due to Camion and Patarin; Wagner; Schroeppel and Shamir; HowgraveGraham and Joux; Becker, Coron
Exponential Time Algorithms for the Minimum Dominating Set problem on some graph classes
"... The Minimum Dominating Set problem remains NPhard when restricted to chordal graphs, circle graphs and dense graphs (i.e.  E > = cn2 for a constant c, 0 < c < 1/2). For each of these three classeswe present algorithms of time complexities O(ffn). More precisely, thealgorithm for chorda ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
The Minimum Dominating Set problem remains NPhard when restricted to chordal graphs, circle graphs and dense graphs (i.e.  E > = cn2 for a constant c, 0 < c < 1/2). For each of these three classeswe present algorithms of time complexities O(ffn). More precisely, thealgorithm
A moderately exponential time algorithm for full degree spanning tree
 in the proceedings of TAMC 2008, LNCS 4978
, 2008
"... We present a moderately exponential time exact algorithm for the wellstudied Full Degree Spanning Tree problem, an NPhard variant of the Spanning Tree problem. Given a graph G, the objective is to find a spanning tree T of G which maximizes the number of vertices that have the same degree in T as i ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present a moderately exponential time exact algorithm for the wellstudied Full Degree Spanning Tree problem, an NPhard variant of the Spanning Tree problem. Given a graph G, the objective is to find a spanning tree T of G which maximizes the number of vertices that have the same degree
Improving Deterministic and Randomized ExponentialTime Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
, 2006
"... NPcomplete problems cannot have efficient algorithms unless P = NP. Due to their importance in practice, however, it is useful to improve the known exponentialtime algorithms for NPcomplete problems. We survey some of the recent results on such improved exponentialtime algorithms for the NPcom ..."
Abstract
 Add to MetaCart
NPcomplete problems cannot have efficient algorithms unless P = NP. Due to their importance in practice, however, it is useful to improve the known exponentialtime algorithms for NPcomplete problems. We survey some of the recent results on such improved exponentialtime algorithms for the NP
Exact Exponential Time Algorithms for Max Internal Spanning Tree
 In WG (2009). LNCS 5911
"... Abstract. We are considering the N Phard problem of finding a spanning tree with many internal vertices. This problem is a generalization of the famous and wellstudied Hamiltonian Path problem. We present an dynamicprogramming approach for general and degreebounded graphs obtaining a run times o ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
of the form O ∗ (c n) (c ≤ 3). The main result is an algorithm for the case with maximum degree three. It only consumes polynomial space and achieves a run time of O ∗ (1.8916 n).
Fast ExponentialTime Algorithms for the Forest Counting in Graph Classes
"... We prove #Pcompleteness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O ∗ (1.8494 m) time for 3regular graphs, and O ∗ (1.9706 m) time for unit interval graphs, where m is the number of edges in the graph and O ∗no ..."
Abstract
 Add to MetaCart
We prove #Pcompleteness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O ∗ (1.8494 m) time for 3regular graphs, and O ∗ (1.9706 m) time for unit interval graphs, where m is the number of edges in the graph and O
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations (Extended Abstract)
, 2009
"... We give deterministic 2O(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 nO(n) running time of the best pre ..."
Abstract

Cited by 62 (3 self)
 Add to MetaCart
We give deterministic 2O(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 nO(n) running time of the best
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Results 11  20
of
2,393,104