Sciweavers

3096 search results - page 182 / 620
» Theory and Use of the EM Algorithm
Sort
View
UAI
2004
15 years 6 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
CAIP
2001
Springer
166views Image Analysis» more  CAIP 2001»
15 years 9 months ago
Application of Adaptive Hypergraph Model to Impulsive Noise Detection
In this paper, using hypergraph theory, we introduce an image model called Adaptive Image Neighborhood Hypergraph (AINH). From this model we propose a combinatorial definition of ...
Soufiane Rital, Alain Bretto, Driss Aboutajdine, H...
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
15 years 11 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 2 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
ICDCIT
2007
Springer
15 years 11 months ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...