Sciweavers

2938 search results - page 477 / 588
» On obfuscating point functions
Sort
View
SIGMETRICS
2008
ACM
13 years 10 months ago
DRAM is plenty fast for wirespeed statistics counting
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
Bill Lin, Jun (Jim) Xu
SIGPRO
2008
107views more  SIGPRO 2008»
13 years 10 months ago
Exploiting geometry for improved hybrid AOA/TDOA-based localization
In this paper we examine the geometrically constrained optimization approach to localization with hybrid bearing (angle of arrival, AOA) and time difference of arrival (TDOA) sens...
Adrian N. Bishop, Baris Fidan, Kutluyil Dogancay, ...
IJNSEC
2007
139views more  IJNSEC 2007»
13 years 10 months ago
Virtual Private Services: Coordinated Policy Enforcement for Distributed Applications
Large scale distributed applications combine network access with multiple storage and computational elements. The distributed responsibility for resource control creates new secur...
Sotiris Ioannidis, Steven M. Bellovin, John Ioanni...
SPEECH
2008
79views more  SPEECH 2008»
13 years 10 months ago
Adapting speaking after evidence of misrecognition: Local and global hyperarticulation
In this paper we examine the two-way relationship between hyperarticulation and evidence of misrecognition of computer-directed speech. We report the results of an experiment in w...
Amanda Stent, Marie K. Huffman, Susan E. Brennan
ANOR
2005
120views more  ANOR 2005»
13 years 10 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello