Sciweavers

1402 search results - page 130 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
ML
2010
ACM
193views Machine Learning» more  ML 2010»
14 years 4 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
CPAIOR
2007
Springer
15 years 4 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
81
Voted
ILP
2004
Springer
15 years 3 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
81
Voted
SPIN
2009
Springer
15 years 4 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
15 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth