Sciweavers

84 search results - page 16 / 17
» Fast algorithms for polynomial solutions of linear different...
Sort
View
INFOCOM
2003
IEEE
14 years 20 days ago
Load optimal MPLS routing with N+M labels
Abstract— MPLS is becoming an important protocol for intradomain routing. MPLS routers are offered by the major vendors and many ISPs are deploying MPLS in their IP backbones, as...
David Applegate, Mikkel Thorup
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 6 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 7 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
CGF
2010
157views more  CGF 2010»
13 years 4 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 2 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels