Sciweavers

9871 search results - page 1 / 1975
» On the Structure of Low Sets
Sort
View
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
13 years 8 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
ISLPED
2003
ACM
127views Hardware» more  ISLPED 2003»
13 years 10 months ago
Lightweight set buffer: low power data cache for multimedia application
A new architectural technique to reduce power dissipation in data caches is proposed. In multimedia applications, a major portion of data cache accesses hit in the same cache set ...
Jun Yang 0002, Youtao Zhang
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 2 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
VLDB
2003
ACM
107views Database» more  VLDB 2003»
14 years 5 months ago
A performance study of four index structures for set-valued attributes of low cardinality
The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structu...
Sven Helmer, Guido Moerkotte
MICS
2007
128views more  MICS 2007»
13 years 4 months ago
Structured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
Dongxia Sun, Lihong Zhi