Sciweavers

3510 search results - page 6 / 702
» Searching with numbers
Sort
View
ICCV
2009
IEEE
13 years 4 months ago
Tracking a large number of objects from multiple views
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
Zheng Wu, Nickolay I. Hristov, Tyson L. Hedrick, T...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 8 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
CIKM
2008
Springer
13 years 8 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
13 years 10 months ago
Comparison of NEWUOA with different numbers of interpolation points on the BBOB noisy testbed
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
Raymond Ros
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 6 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama