Sciweavers

588 search results - page 44 / 118
» Reducibility and Completeness in Private Computations
Sort
View
RC
2002
72views more  RC 2002»
13 years 9 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
MOBISYS
2009
ACM
14 years 10 months ago
xShare: supporting impromptu sharing of mobile phones
Loaded with personal data, e.g. photos, contacts, and call history, mobile phones are truly personal devices. Yet it is often necessary or desirable to share our phones with other...
Yunxin Liu, Ahmad Rahmati, Yuanhe Huang, Hyukjae J...
FGIT
2010
Springer
13 years 8 months ago
Improved Location Aided Cluster Based Routing Protocol for GPS Enabled Manets
Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. Completely GPS free as well as GPS scarce positioning systems for ...
S. Mangai, A. Tamilarasi
ICCV
2005
IEEE
14 years 12 months ago
Dynamic Measurement Clustering to Aid Real Time Tracking
Many parameter estimation problems admit divide and conquer or partitioning techniques in order to reduce a highdimensional task into several reduced-dimension problems. These tec...
Christopher Kemp, Tom Drummond
WSNA
2003
ACM
14 years 3 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li