Sciweavers

1632 search results - page 307 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 3 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ICDCS
2008
IEEE
15 years 9 months ago
PFC: Transparent Optimization of Existing Prefetching Strategies for Multi-Level Storage Systems
The multi-level storage architecture has been widely adopted in servers and data centers. However, while prefetching has been shown as a crucial technique to exploit the sequentia...
Zhe Zhang, Kyuhyung Lee, Xiaosong Ma, Yuanyuan Zho...
ISCAS
2008
IEEE
136views Hardware» more  ISCAS 2008»
15 years 9 months ago
Spatial-temporal consistent labeling for multi-camera multi-object surveillance systems
Abstract—For an intelligent multi-camera multi-object surveillance system, object correspondence across time and space is important to many smart visual applications. In this pap...
Jing-Ying Chang, Tzu-Heng Wang, Shao-Yi Chien, Lia...
SIAMSC
2008
129views more  SIAMSC 2008»
15 years 3 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
155
Voted
AI
2002
Springer
15 years 3 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...