481 search results - page 44 / 97 » Approximate XML Query Answers |
STOC
2001
ACM
14 years 8 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...
TCOS
2010
13 years 6 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...
INEX
2004
Springer
14 years 1 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...
CSE
2009
IEEE
14 years 15 days 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...
MICAI
2004
Springer
14 years 1 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 ...