Sciweavers

4066 search results - page 162 / 814
» Almost Complete Sets
Sort
View
CODES
2005
IEEE
15 years 8 months ago
An efficient direct mapped instruction cache for application-specific embedded systems
Caches may consume half of a microprocessor’s total power and cache misses incur accessing off-chip memory, which is both time consuming and energy costly. Therefore, minimizing...
Chuanjun Zhang
AAAI
1990
15 years 7 months ago
Solving Term Inequalities
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
Gerald E. Peterson
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
16 years 6 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
SAT
2009
Springer
121views Hardware» more  SAT 2009»
16 years 1 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
ITNG
2006
IEEE
16 years 14 days ago
Closed Multidimensional Sequential Pattern Mining
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequ...
Panida Songram, Veera Boonjing, Sarun Intakosum