746 search results - page 40 / 150 » Fast (Structured) Newton Computations |
EUROCAST
2003
Springer
14 years 3 months ago
2003
Springer
Computer vision tasks such as learning, recognition, classification or segmentation applied to spatial data often requires spatial normalization of repeated features and structure...
CSR
2010
Springer
14 years 2 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
SGP
2004
14 years 14 days ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
SOFSEM
2010
Springer
13 years 8 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...