Sciweavers

3677 search results - page 53 / 736
» Generalized Adaptive A*
Sort
View
FLAIRS
1998
15 years 1 months ago
A Technique for Generalizing Temporal Durations in Relational Databases
Weaddress the problemof generalizing temporal data concerning durations extracted from relational databases.Ourapproachisbasedona domaingenerMizationgraphthatdefinesa partialorder...
Dee Jay Randall, Howard J. Hamilton, Robert J. Hil...
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 4 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
SOSP
2007
ACM
15 years 8 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
ANSS
2006
IEEE
15 years 6 months ago
A New Approach for Computing Conditional Probabilities of General Stochastic Processes
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
Fabian Wickborn, Claudia Isensee, Thomas Simon, Sa...
EUROCRYPT
2003
Springer
15 years 5 months ago
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions
Abstract. In this paper we present a simpler construction of a publickey encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapd...
Yehuda Lindell