Sciweavers

2376 search results - page 285 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DBA
2006
182views Database» more  DBA 2006»
13 years 11 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
CACM
2008
53views more  CACM 2008»
13 years 9 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
TCS
2008
13 years 9 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
CCE
2005
13 years 9 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
CG
2005
Springer
13 years 9 months ago
Hyper-Resolution: Image detail reconstruction through parametric edges
Hyper-Resolution, a new technique for super-resolution reconstruction of images, is based on matching lowresolution target image details to their high-resolution counterparts from...
Lijun Yin, Matt T. Yourst