5022 search results - page 108 / 1005 » Data structures and problem solving using Java |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
DAM
2010
14 years 8 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
160
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...