Sciweavers

2767 search results - page 205 / 554
» Universal Exponentiation Algorithm
Sort
View
TIT
2008
83views more  TIT 2008»
15 years 2 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 6 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 6 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
97
Voted
ICDCS
2006
IEEE
15 years 8 months ago
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
Alysson Neves Bessani, Joni da Silva Fraga, Miguel...
108
Voted
PR
2006
114views more  PR 2006»
15 years 2 months ago
Orientation feature for fingerprint matching
This paper describes a fingerprint verification algorithm based on the orientation field. The orientation field of a fingerprint image has also been used for image alignment. Area...
Jayant V. Kulkarni, Bhushan D. Patil, Raghunath S....