Sciweavers

142 search results - page 11 / 29
» Generalizing Graphs Using Amalgamation and Selection
Sort
View
LPNMR
2005
Springer
15 years 5 months ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 3 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
VLSID
2002
IEEE
151views VLSI» more  VLSID 2002»
16 years 15 hour ago
Mode Selection and Mode-Dependency Modeling for Power-Aware Embedded Systems
Among the many techniques for system-level power management, it is not currently possible to guarantee timing constraints and have a comprehensive system model at the same time. S...
Dexin Li, Pai H. Chou, Nader Bagherzadeh
IV
2003
IEEE
183views Visualization» more  IV 2003»
15 years 4 months ago
Visualisation of RDF(S)-based Information
As Resource Description Framework (RDF) reaches maturity, there is an increasing need for tools that support it. A common and natural representation for RDF data is a directed lab...
Alexandru Telea, Flavius Frasincar, Geert-Jan Houb...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 1 days ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos