Sciweavers

4670 search results - page 735 / 934
» Testing that distributions are close
Sort
View
TSMC
2008
147views more  TSMC 2008»
15 years 6 months ago
Tracking of Multiple Targets Using Online Learning for Reference Model Adaptation
Recently, much work has been done in multiple ob-4 ject tracking on the one hand and on reference model adaptation5 for a single-object tracker on the other side. In this paper, we...
Franz Pernkopf
CORR
2000
Springer
116views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
VLDB
2002
ACM
138views Database» more  VLDB 2002»
15 years 6 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy