11219 search results - page 100 / 2244 » Retroactive data structures |
101
click to vote
TIT
1998
15 years 2 months ago
1998
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
101
click to vote
COMPGEOM
2004
ACM
15 years 7 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...
100
click to vote
PARA
2004
Springer
15 years 7 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...
135
click to vote
STACS
2010
Springer
15 years 7 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 ...
102
click to vote
ICCL
1992
IEEE
15 years 6 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...