Sciweavers

159 search results - page 22 / 32
» Boosting margin based distance functions for clustering
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 10 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
SEMCO
2007
IEEE
14 years 2 months ago
Evolutionary Conceptual Clustering of Semantically Annotated Resources
A clustering method is presented which can be applied to knowledge bases storing semantically annotated resources. The method can be used to discover groupings of structured objec...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
IWMM
2009
Springer
130views Hardware» more  IWMM 2009»
14 years 3 months ago
A component model of spatial locality
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
Xiaoming Gu, Ian Christopher, Tongxin Bai, Chengli...
ECCV
2008
Springer
14 years 10 months ago
Regular Texture Analysis as Statistical Model Selection
An approach to the analysis of images of regular texture is proposed in which lattice hypotheses are used to define statistical models. These models are then compared in terms of t...
Junwei Han, Stephen J. McKenna, Ruixuan Wang
ISBI
2011
IEEE
13 years 10 days ago
3D elastic registration improves HARDI-derived fiber alignment and automated tract clustering
High angular resolution diffusion imaging (HARDI) allows population studies of fiber integrity and connectivity. Tractography can extract individual fibers. For group studies, fib...
Yan Jin, Yonggang Shi, Neda Jahanshad, Iman Aganj,...