Sciweavers

760 search results - page 109 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
WWW
2007
ACM
14 years 9 months ago
A link classification based approach to website topic hierarchy generation
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
Nan Liu, Christopher C. Yang
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 9 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
ICAIL
2009
ACM
14 years 1 months ago
The network of French legal codes
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
Pierre Mazzega, Danièle Bourcier, Romain Bo...
FLAIRS
2008
13 years 11 months ago
A New Approach to Heuristic Estimations for Cost-Based Planning
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...