Sciweavers

350 search results - page 56 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
16 years 9 days ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
189
Voted
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
16 years 1 months ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
IPCCC
2007
IEEE
15 years 6 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
ISCAS
2006
IEEE
104views Hardware» more  ISCAS 2006»
15 years 5 months ago
Average lengths of wire routing under M-architecture and X-architecture
— The X-architecture is a new integrated-circuit wiring technique in the physical design. Compared with the currently used M-architecture, which uses either horizontal or vertica...
S. P. Shang, Xiaodong Hu, Tong Jing