Sciweavers

297 search results - page 5 / 60
» On the Fastest Vickrey Algorithm
Sort
View
DALT
2008
Springer
13 years 9 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
13 years 5 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
ARITH
1999
IEEE
13 years 11 months ago
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication
A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm i...
Guy Even, Peter-Michael Seidel
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
13 years 11 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner
ICCD
2007
IEEE
141views Hardware» more  ICCD 2007»
14 years 4 months ago
Floating-point division algorithms for an x86 microprocessor with a rectangular multiplier
Floating-point division is an important operation in scientific computing and multimedia applications. This paper presents and compares two division algorithms for an x86 micropro...
Michael J. Schulte, Dimitri Tan, Carl Lemonds