Sciweavers

1263 search results - page 66 / 253
» A* with Bounded Costs
Sort
View
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 1 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
PODS
2006
ACM
95views Database» more  PODS 2006»
15 years 10 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
RFIDSEC
2010
14 years 8 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
IACR
2011
221views more  IACR 2011»
13 years 9 months ago
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
Süleyman Kardas, Mehmet Sabir Kiraz, Muhammed...
WSC
1997
14 years 11 months ago
Multiplexed State Saving for Bounded Rollback
Optimistic parallel discrete event simulation (PDES) uses a state history trail to support rollback. State saving strategies range from making a complete copy of a model’s state...
Fabian Gomes, Brian Unger, John G. Cleary, Steve F...