Sciweavers

2899 search results - page 150 / 580
» Dynamic Trees in Practice
Sort
View
WISEC
2010
ACM
13 years 7 months ago
Preventing multi-query attack in location-based services
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
Nilothpal Talukder, Sheikh Iqbal Ahamed
INFOCOM
2009
IEEE
14 years 4 months ago
FiConn: Using Backup Port for Server Interconnection in Data Centers
Abstract— The goal of data center networking is to interconnect a large number of server machines with low equipment cost, high and balanced network capacity, and robustness to l...
Dan Li, Chuanxiong Guo, Haitao Wu, Kun Tan, Songwu...
GI
2004
Springer
14 years 3 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
AI
2002
Springer
13 years 9 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...