Sciweavers

2280 search results - page 340 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
FCT
2001
Springer
15 years 9 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
CIVR
2007
Springer
154views Image Analysis» more  CIVR 2007»
15 years 10 months ago
Representing shape with a spatial pyramid kernel
The objective of this paper is classifying images by the object categories they contain, for example motorbikes or dolphins. There are three areas of novelty. First, we introduce ...
Anna Bosch, Andrew Zisserman, Xavier Muñoz
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
FOCS
2008
IEEE
15 years 11 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang