Sciweavers

539 search results - page 70 / 108
» The N R One Time Password System
Sort
View
ALGOSENSORS
2009
Springer
15 years 4 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
LREC
2010
144views Education» more  LREC 2010»
14 years 11 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman
SSDBM
2003
IEEE
142views Database» more  SSDBM 2003»
15 years 3 months ago
A Strategy Selection Framework for Adaptive Prefetching in Data Visualization
Accessing data stored in persistent memory represents a bottleneck for current visual exploration applications. Semantic caching of frequent queries at the client-side along with ...
Punit R. Doshi, Geraldine E. Rosario, Elke A. Rund...
SIGSOFT
2005
ACM
15 years 10 months ago
Dynamically discovering architectures with DiscoTect
One of the challenges for software architects is ensuring that an implemented system faithfully represents its architecture. We describe and demonstrate a tool, called DiscoTect, ...
Bradley R. Schmerl, David Garlan, Hong Yan
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 4 days ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...