Sciweavers

163 search results - page 17 / 33
» Fast Edge-Routing for Large Graphs
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
JAIR
2006
179views more  JAIR 2006»
13 years 7 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 2 days ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
KRDB
1998
83views Database» more  KRDB 1998»
13 years 9 months ago
Semantic Query Optimisation and Rule Graphs
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
Jerome Robinson, Barry G. T. Lowden
SPIRE
2009
Springer
14 years 2 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro