Sciweavers

2125 search results - page 230 / 425
» On Graph Complexity
Sort
View
156
Voted
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 7 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
113
Voted
DEXAW
2004
IEEE
152views Database» more  DEXAW 2004»
15 years 7 months ago
OntoEditor: A Web Tool for Manipulating Ontologies Stored in Database Servers
The Web is moving to a new generation in which machine-understandable processing is mandatory. In order to achieve this goal it is essential to define ontologies which enable the ...
Cláudio de Souza Baptista, Karine F. Vascon...
137
Voted
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
15 years 7 months ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri
124
Voted
AIPS
2008
15 years 5 months ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson
114
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Reeb spaces of piecewise linear mappings
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
Herbert Edelsbrunner, John Harer, Amit K. Patel