Sciweavers

917 search results - page 152 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
ERCIMDL
2005
Springer
115views Education» more  ERCIMDL 2005»
15 years 3 months ago
A No-Compromises Architecture for Digital Document Preservation
Abstract. The Multivalent Document Model offers a practical, proven, nocompromises architecture for preserving digital documents of potentially any data format. We have implemented...
Thomas A. Phelps, Paul B. Watry
61
Voted
ICANN
2005
Springer
15 years 3 months ago
Accurate and Robust Image Superresolution by Neural Processing of Local Image Representations
Image superresolution involves the processing of an image sequence to generate a still image with higher resolution. Classical approaches, such as bayesian MAP methods, require ite...
Carlos Miravet, Francisco de Borja Rodrígue...
DATAMINE
1998
145views more  DATAMINE 1998»
14 years 9 months ago
A Tutorial on Support Vector Machines for Pattern Recognition
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
Christopher J. C. Burges
87
Voted
POPL
2010
ACM
14 years 8 months ago
S-Net for multi-memory multicores
S-NET is a declarative coordination language and component technology aimed at modern multi-core/many-core architectures and systems-on-chip. It builds on the concept of stream pr...
Clemens Grelck, Jukka Julku, Frank Penczek