481 search results - page 44 / 97 » Approximate XML Query Answers |
150
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
185
click to vote
TCOS
2010
15 years 4 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
144
click to vote
INEX
2004
Springer
15 years 11 months ago
2004
Springer
NEXI was introduced in INEX 2004 as a query language for specifying structured and unstructured queries on XML documents. A language expressive enough for INEX yet simple enough f...
146
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
— The ubiquity of mobile devices has led to a rising demand for location-based services and applications. A major part of these services is based on the location-detection capabi...
154
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...