Sciweavers

1695 search results - page 237 / 339
» Linear, Polynomial or Exponential
Sort
View
ICMCS
2005
IEEE
109views Multimedia» more  ICMCS 2005»
15 years 10 months ago
Spatial Error Concealment Based on Bezier Curves
This paper presents a geometric error concealment scheme for DCT-based image/video data based on the Bezier polynomials (BP). The proposed scheme makes use of the average edge dir...
Rogelio Hasimoto-Beltran, Ashfaq A. Khokhar
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 9 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 9 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
EUROCRYPT
2004
Springer
15 years 9 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
ECCV
2010
Springer
15 years 9 months ago
Affine Puzzle: Realigning Deformed Object Fragments without Correspondences
This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method ...
Csaba Domokos and Zoltan Kato