Sciweavers

478 search results - page 93 / 96
» Improving probability bounds by optimization over subsets
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
ICS
2007
Tsinghua U.
14 years 1 months ago
Cooperative cache partitioning for chip multiprocessors
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...
Jichuan Chang, Gurindar S. Sohi
ICDCS
2010
IEEE
13 years 11 months ago
Adaptive Jamming-Resistant Broadcast Systems with Partial Channel Sharing
—Wireless communication is particularly vulnerable to signal jamming attacks. Spread spectrum mitigates such problem by spreading normal narrowband signals over a much wider band...
Qi Dong, Donggang Liu
ATAL
2007
Springer
14 years 1 months ago
Meta-level coordination for solving negotiation chains in semi-cooperative multi-agent systems
A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the c...
Xiaoqin Zhang, Victor R. Lesser
EUROCRYPT
2003
Springer
14 years 21 days ago
Resettable Zero-Knowledge in the Weak Public-Key Model
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu