11214 search results - page 118 / 2243 » Just-in-time data structures |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
PARA
2004
Springer
14 years 3 months ago
2004
Springer
A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an ef...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
ICCL
1992
IEEE
14 years 2 months ago
1992
IEEE
Multiparadigm programming is a term used to describe a style of software development that makes use of facilities originally designed in support of a number of di erent programmin...
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
14 years 2 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...