2907 search results - page 26 / 582 » Presentations of Structures in Admissible Sets |
ICCAD
2009
IEEE
13 years 6 months ago
2009
IEEE
Present application specific embedded systems tend to choose instruction set extensions (ISEs) based on limitations imposed by the available data bandwidth to custom functional un...
STACS
1997
Springer
14 years 18 days ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
FIMI
2003
13 years 9 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
MICRO
1997
IEEE
14 years 20 days ago
1997
IEEE
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
CSC
2008
13 years 10 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...