11211 search results - page 134 / 2243 » Rank-Sensitive Data Structures |
136
click to vote
ITA
2007
15 years 22 days ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
89
Voted
COMPGEOM
2004
ACM
15 years 6 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...
90
Voted
PARA
2004
Springer
15 years 6 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...
113
Voted
STACS
2010
Springer
15 years 6 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 ...
88
Voted
ICCL
1992
IEEE
15 years 4 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...