Sciweavers

1756 search results - page 158 / 352
» Mapping Small Worlds
Sort
View
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
IPPS
2006
IEEE
15 years 10 months ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang
COMPGEOM
2006
ACM
15 years 10 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
ISMIR
2005
Springer
179views Music» more  ISMIR 2005»
15 years 10 months ago
Databionic Visualization of Music Collections According to Perceptual Distance
We describe the MusicMiner system for organizing large collections of music with databionic mining techniques. Low level audio features are extracted from the raw audio data on sh...
Fabian Mörchen, Alfred Ultsch, Mario Nöc...
OTM
2005
Springer
15 years 10 months ago
Don't Mind Your Vocabulary: Data Sharing Across Heterogeneous Peers
The strong dynamics of peer-to-peer networks, coupled with the diversity of peer vocabularies, makes query processing in peer database systems a very challenging task. In this pape...
Mehedi Masud, Iluju Kiringa, Anastasios Kementsiet...