Sciweavers

2659 search results - page 388 / 532
» Do we mean the same
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 4 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
COCOON
2010
Springer
15 years 9 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
15 years 11 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
ECCV
2004
Springer
15 years 10 months ago
Biometric Sensor Interoperability: A Case Study in Fingerprints
The problem of biometric sensor interoperability has received limited attention in the literature. Most biometric systems operate under the assumption that the data (viz., images) ...
Arun Ross, Anil K. Jain
148
Voted
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner