Sciweavers

101 search results - page 14 / 21
» Experimental study of protocol-independent redundancy elimin...
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
SBBD
2004
119views Database» more  SBBD 2004»
14 years 11 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ADC
2003
Springer
118views Database» more  ADC 2003»
15 years 3 months ago
CrystalBall : A Framework for Mining Variants of Association Rules
The mining of informative rules calls for methods that include different attributes (e.g., weights, quantities, multipleconcepts) suitable for the context of the problem to be an...
Kok-Leong Ong, Wee Keong Ng, Ee-Peng Lim
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
15 years 1 months ago
Configuring an evolutionary tool for the inventory and transportation problem
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...
APSCC
2008
IEEE
15 years 4 months ago
Integration and Implementation of Secured IP Based Surveillance Networks
— This paper presents a method of integration and implementation of transmitting video and audio data from multiple Internet Protocol (IP) surveillance cameras in a wireless sens...
Charles C. Castello, Jeffrey Fan, Te-Shun Chou, Ho...