Sciweavers

2104 search results - page 36 / 421
» Sorting with networks of data structures
Sort
View
TKDE
2002
127views more  TKDE 2002»
15 years 3 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
118
Voted
IJON
2006
60views more  IJON 2006»
15 years 3 months ago
Spatiotemporal clustering of synchronized bursting events in neuronal networks
in vitro neuronal networks display Synchronized Bursting Events (SBEs), with characteristic temporal width of 100-500 ms and frequency of once every few seconds. We analyze such d...
Uri Barkan, David Horn
SSPR
1998
Springer
15 years 8 months ago
Modified Minimum Classification Error Learning and Its Application to Neural Networks
A novel method to improve the generalization performance of the Minimum Classification Error (MCE) / Generalized Probabilistic Descent (GPD) learning is proposed. The MCE/GPD learn...
Hiroshi Shimodaira, Jun Rokui, Mitsuru Nakai
AVBPA
2005
Springer
303views Biometrics» more  AVBPA 2005»
15 years 9 months ago
Indexing Biometric Databases Using Pyramid Technique
Abstract. Biometric identification has emerged as a reliable means of controlling access to both physical and virtual spaces. In spite of the rapid proliferation of large-scale dat...
Amit Mhatre, Sharat Chikkerur, Venu Govindaraju
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
15 years 10 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory