Sciweavers

3055 search results - page 180 / 611
» Randomized Search Trees
Sort
View
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
15 years 6 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
86
Voted
ICCS
2004
Springer
15 years 6 months ago
ABSDM: Agent Based Service Discovery Mechanism in Internet
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...
Shijian Li, Congfu Xu, Zhaohui Wu, Yunhe Pan, Xuel...
111
Voted
IJCAI
2003
15 years 2 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
104
Voted
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 2 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
103
Voted
ENTCS
2000
123views more  ENTCS 2000»
15 years 16 days ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle