Sciweavers

505 search results - page 32 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
ICDE
2008
IEEE
425views Database» more  ICDE 2008»
16 years 9 months ago
NAGA: Searching and Ranking Knowledge
The Web has the potential to become the world’s largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracte...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
MICRO
2006
IEEE
73views Hardware» more  MICRO 2006»
15 years 3 months ago
Merging Head and Tail Duplication for Convergent Hyperblock Formation
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
Bertrand A. Maher, Aaron Smith, Doug Burger, Kathr...
SPATIALCOGNITION
2004
Springer
15 years 3 months ago
Modelling Models of Robot Navigation Using Formal Spatial Ontology
Abstract. In this paper we apply a formal ontological framework in order to deconstruct two prominent approaches to navigation from cognitive robotics, the Spatial Semantic Hierarc...
John A. Bateman, Scott Farrar
COMBINATORICA
2010
14 years 7 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
CIKM
2003
Springer
15 years 2 months ago
Hierarchical graph indexing
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
James Abello, Yannis Kotidis