Sciweavers

2609 search results - page 272 / 522
» Optimizing for parallelism and data locality
Sort
View
NIPS
2004
15 years 8 months ago
Spike Sorting: Bayesian Clustering of Non-Stationary Data
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
Aharon Bar-Hillel, Adam Spiro, Eran Stark
CORR
2010
Springer
427views Education» more  CORR 2010»
15 years 5 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
PRL
2006
139views more  PRL 2006»
15 years 6 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
INFOCOM
2012
IEEE
13 years 9 months ago
Characterizing geospatial dynamics of application usage in a 3G cellular data network
—Recent studies on cellular network measurement have provided the evidence that significant geospatial correlations, in terms of traffic volume and application access, exist in...
Muhammad Zubair Shafiq, Lusheng Ji, Alex X. Liu, J...
IJCAI
2003
15 years 8 months ago
Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems
In data-integration systems, information sources often have various constraints such as “all houses stored at a source have a unique address.” These constraints are very usefu...
Chen Li