Sciweavers

807 search results - page 37 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Background subtraction technique based on chromaticity and intensity patterns
This paper presents an efficient Real-Time method for detecting moving objects in unconstrained environments, using a background subtraction technique. A new background model that...
Ariel Amato, Mikhail Mozerov, Ivan Huerta Casado, ...
APPINF
2003
15 years 5 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
ISI
2006
Springer
15 years 4 months ago
Collective Sampling and Analysis of High Order Tensors for Chatroom Communications
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
Evrim Acar, Seyit Ahmet Çamtepe, Bülen...
BMCBI
2010
160views more  BMCBI 2010»
15 years 4 months ago
Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
Young-Rae Cho, Aidong Zhang
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 4 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...