Sciweavers

10492 search results - page 1746 / 2099
» Challenges of Grid Computing
Sort
View
ICISC
2008
123views Cryptology» more  ICISC 2008»
15 years 6 months ago
The Swiss-Knife RFID Distance Bounding Protocol
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicini...
Chong Hee Kim, Gildas Avoine, François Koeu...
ICVGIP
2008
15 years 6 months ago
Automated Flower Classification over a Large Number of Classes
We investigate to what extent combinations of features can improve classification performance on a large dataset of similar classes. To this end we introduce a 103 class flower da...
Maria-Elena Nilsback, Andrew Zisserman
ICWS
2008
IEEE
15 years 6 months ago
Dynamic Availability Estimation for Service Selection Based on Status Identification
With the popularity of Service-Oriented Computing, how to construct highly available service-oriented applications is becoming a hot topic in both the research and industry commun...
Lingshuang Shao, Lu Zhang, Tao Xie, Junfeng Zhao, ...
IJCAI
2007
15 years 6 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
OPODIS
2008
15 years 6 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel
« Prev « First page 1746 / 2099 Last » Next »