Sciweavers

3471 search results - page 323 / 695
» Obstacle Numbers of Graphs
Sort
View
FLAIRS
2003
15 years 8 months ago
Spatially-Aware Information Retrieval with Graph-Based Qualitative Reference Models
Geo-referenced information is used by a growing number of “spatially-aware” tools in different application areas, including tourism, marketing, environmental management, and m...
Thomas Vögele, Christoph Schlieder
AIPS
2000
15 years 8 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
162
Voted
DAWAK
2010
Springer
15 years 7 months ago
Frequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
Chuntao Jiang, Frans Coenen, Michele Zito
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
193
Voted
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
15 years 4 months ago
GREMA: Graph reduction based efficient mask assignment for double patterning technology
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
Yue Xu, Chris Chu