Sciweavers

281 search results - page 35 / 57
» A Method for Invariant Generation for Polynomial Continuous ...
Sort
View
CONCUR
2000
Springer
13 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 8 months ago
Real-time ranking with concept drift using expert advice
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...
Hila Becker, Marta Arias
DSOM
2003
Springer
14 years 28 days ago
Idiosyncratic Signatures for Authenticated Execution of Management Code
TrustedFlow™ is a software solution to the problem of remotely authenticating code during execution. A continuous flow of idiosyncratic signatures assures that the software from ...
Mario Baldi, Yoram Ofek, Moti Yung
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
JFR
2008
87views more  JFR 2008»
13 years 7 months ago
Robust vision-based underwater homing using self-similar landmarks
Next generation Autonomous Underwater Vehicles (AUVs) will be required to robustly identify underwater targets for tasks such as inspection, localization and docking. Given their ...
Amaury Nègre, Cédric Pradalier, Matt...