Sciweavers

223 search results - page 16 / 45
» Pattern Search Methods for Linearly Constrained Minimization
Sort
View
ICPR
2006
IEEE
16 years 26 days ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 5 days ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 3 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
NN
2008
Springer
150views Neural Networks» more  NN 2008»
14 years 11 months ago
Neural network based pattern matching and spike detection tools and services - in the CARMEN neuroinformatics project
In the study of information flow in the nervous system, component processes can be investigated using a range of electrophysiological and imaging techniques. Although data is diff...
Martyn Fletcher, Bojian Liang, Leslie Smith, Alast...
SBBD
2008
256views Database» more  SBBD 2008»
15 years 1 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...