Sciweavers

664 search results - page 58 / 133
» The tree Constraint
Sort
View
IWPC
2003
IEEE
14 years 29 days ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...
EUROCRYPT
2004
Springer
14 years 1 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
ICDM
2010
IEEE
154views Data Mining» more  ICDM 2010»
13 years 5 months ago
Discrimination Aware Decision Tree Learning
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
Faisal Kamiran, Toon Calders, Mykola Pechenizkiy
ASPDAC
2012
ACM
247views Hardware» more  ASPDAC 2012»
12 years 3 months ago
Through-silicon-via-induced obstacle-aware clock tree synthesis for 3D ICs
— In this paper, we present an obstacle-aware clock tree synthesis method for through-silicon-via (TSV)-based 3D ICs. A unique aspect of this problem lies in the fact that variou...
Xin Zhao, Sung Kyu Lim
TPDS
2008
72views more  TPDS 2008»
13 years 7 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert