Sciweavers

21324 search results - page 479 / 4265
» Making the case for computing
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 7 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
ISSAC
2009
Springer
169views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Computations modulo regular chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
Xin Li, Marc Moreno Maza, Wei Pan
IJCNN
2008
IEEE
16 years 1 months ago
Multifractal feature vectors for Brain-Computer interfaces
—This article introduces a new feature vector extraction for EEG signals using multifractal analysis. The validity of the approach is asserted on real data sets from the BCI comp...
Nicolas Brodu
DATE
2005
IEEE
140views Hardware» more  DATE 2005»
16 years 20 days ago
Quality-Driven Proactive Computation Elimination for Power-Aware Multimedia Processing
We present a novel, quality-driven, architectural-level approach that trades-off the output quality to enable power-aware processing of multimedia streams. The error tolerance of ...
Shrirang M. Yardi, Michael S. Hsiao, Thomas L. Mar...
GRID
2005
Springer
16 years 17 days ago
Grid-level computing needs pervasive debugging
— Developing applications for parallel and distributed systems is hard due to their nondeterministic nature; developing debugging tools for such systems and applications is even ...
Rashid Mehmood, Jon Crowcroft, Steven Hand, Steven...