Sciweavers

1918 search results - page 18 / 384
» Discovering Cortical Algorithms
Sort
View
93
Voted
IEEEHPCS
2010
14 years 8 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
72
Voted
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 3 months ago
Discovering event evidence amid massive, dynamic datasets
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
Robert M. Patton, Thomas E. Potok
SEMCO
2007
IEEE
15 years 4 months ago
Clustering Using Feature Domain Similarity to Discover Word Senses for Adjectives
This paper presents a new clustering algorithm called DSCBC which is designed to automatically discover word senses for polysemous words. DSCBC is an extension of CBC Clustering [...
Noriko Tomuro, Steven L. Lytinen, Kyoko Kanzaki, H...
67
Voted
ECCV
2006
Springer
15 years 11 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
TOG
2008
143views more  TOG 2008»
14 years 9 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...