874 search results - page 137 / 175 » Faster Algorithms for Semi-Matching Problems |
PVLDB
2008
13 years 9 months ago
2008
Sorting a list of input numbers is one of the most fundamental problems in the field of computer science in general and high-throughput database applications in particular. Althou...
ICCAD
2001
IEEE
14 years 6 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
ACL
1989
13 years 11 months ago
1989
Comparative expressions (CEs) such as "bigger than" and "more oranges than" are highly ambiguous, and their meaning is context dependent. Thus, they pose probl...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
SIBGRAPI
1999
IEEE
14 years 2 months ago
1999
IEEE
Many computer applications are currently using digital video. Recent advances in digital imaging and faster networking infrastructure made this technology very popular, not only fo...