Sciweavers

829 search results - page 100 / 166
» Bandit Algorithms for Tree Search
Sort
View
147
Voted
TAMC
2007
Springer
15 years 9 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
138
Voted
UAI
2004
15 years 4 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
272
Voted

Lecture Notes
443views
17 years 1 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
MMM
2006
Springer
154views Multimedia» more  MMM 2006»
15 years 9 months ago
A robust object shape prediction algorithm in the presence of white Gaussian noise
This paper presents a shape prediction algorithm in a noisy video sequence based on pixel representation in the undecimated wavelet domain. In our algorithm for tracking of user-d...
Mohammad Khansari, Hamid R. Rabiee, M. Asadi, M. G...
105
Voted
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 10 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...