Sciweavers

583 search results - page 62 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
TCAD
2008
100views more  TCAD 2008»
14 years 9 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
CRYPTO
2007
Springer
172views Cryptology» more  CRYPTO 2007»
15 years 1 months ago
Deterministic and Efficiently Searchable Encryption
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...
Mihir Bellare, Alexandra Boldyreva, Adam O'Neill
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
APN
2008
Springer
14 years 11 months ago
Hierarchical Set Decision Diagrams and Automatic Saturation
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...
Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon
WWW
2006
ACM
15 years 10 months ago
Browsing on small screens: recasting web-page segmentation into an efficient machine learning framework
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
Shumeet Baluja