Sciweavers

684 search results - page 63 / 137
» A characterization of b-perfect graphs
Sort
View
HPCC
2005
Springer
15 years 7 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
LPNMR
2005
Springer
15 years 7 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
SCAM
2003
IEEE
15 years 7 months ago
Improving the Static Analysis of Loops by Dynamic Partitioning Techniques
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
Matthieu Martel
IPPS
1998
IEEE
15 years 6 months ago
Measuring the Vulnerability of Interconnection Networks in Embedded Systems
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
Vijay Lakamraju, Zahava Koren, Israel Koren, C. Ma...
NIPS
2008
15 years 3 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh