Sciweavers

33 search results - page 4 / 7
» Shortest Path Queries Between Geometric Objects on Surfaces
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
14 years 29 days ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
14 years 4 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
EATCS
2002
59views more  EATCS 2002»
13 years 7 months ago
Reality and Virtual Reality in Mathematics
This article introduces three of the twentieth century's main philosophies of mathematics and argues that of those three, one describes mathematical reality, the \reality&quo...
Douglas S. Bridges
EDBT
2012
ACM
255views Database» more  EDBT 2012»
11 years 9 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...