Sciweavers

1632 search results - page 229 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
UAI
1996
15 years 5 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
ICDAR
2009
IEEE
15 years 10 months ago
A New Approach for Skew Correction of Documents Based on Particle Swarm Optimization
This paper presents a novel approach for skew correction of documents. Skew correction is modelled as an optimization problem, and for the first time, Particle Swarm Optimization...
Javad Sadri, Mohamed Cheriet
ASIAN
2003
Springer
113views Algorithms» more  ASIAN 2003»
15 years 9 months ago
Global Predicate Detection under Fine-Grained Modalities
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
Punit Chandra, Ajay D. Kshemkalyani
ECML
2006
Springer
15 years 7 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 4 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...