4315 search results - page 128 / 863 » Sorting in linear time |
231
click to vote
FOCS
2002
IEEE
16 years 12 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
185
click to vote
ITC
1999
IEEE
15 years 11 months ago
1999
IEEE
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
208
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
144
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
177
click to vote
ICIP
2003
IEEE
16 years 9 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...