Sciweavers

502 search results - page 93 / 101
» Verifying Balanced Trees
Sort
View
CCS
2008
ACM
13 years 11 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
IJCAI
1993
13 years 11 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 10 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
ALMOB
2007
74views more  ALMOB 2007»
13 years 10 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo
BMCBI
2008
152views more  BMCBI 2008»
13 years 10 months ago
Predicting biological system objectives de novo from internal state measurements
Background: Optimization theory has been applied to complex biological systems to interrogate network properties and develop and refine metabolic engineering strategies. For examp...
Erwin P. Gianchandani, Matthew A. Oberhardt, Antho...