Sciweavers

813 search results - page 115 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 2 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...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
14 years 2 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
ECSQARU
2009
Springer
14 years 2 months ago
Triangulation Heuristics for BN2O Networks
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
Petr Savický, Jirí Vomlel
KDD
2001
ACM
262views Data Mining» more  KDD 2001»
14 years 8 months ago
LOGML: Log Markup Language for Web Usage Mining
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
John R. Punin, Mukkai S. Krishnamoorthy, Mohammed ...
PPOPP
2010
ACM
14 years 5 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...