Sciweavers

315 search results - page 52 / 63
» Are Multiple Runs of Genetic Algorithms Better than One
Sort
View
EDBT
2006
ACM
145views Database» more  EDBT 2006»
14 years 11 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
OOPSLA
1997
Springer
14 years 2 months ago
Efficient Type Inclusion Tests
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
Jan Vitek, R. Nigel Horspool, Andreas Krall
ICASSP
2008
IEEE
14 years 5 months ago
Single-channel speech separation based on modulation frequency
This paper describes an algorithm that performs a simple form of computational auditory scene analysis to separate multiple speech signals from one another on the basis of the mod...
Lingyun Gu, Richard M. Stern
PLDI
1994
ACM
14 years 2 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
SIGCOMM
2005
ACM
14 years 4 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...