Sciweavers

822 search results - page 52 / 165
» Descendants in Increasing Trees
Sort
View
IPPS
2007
IEEE
14 years 4 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
14 years 3 months ago
Postprocessing Decision Trees to Extract Actionable Knowledge
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...
Qiang Yang, Jie Yin, Charles X. Ling, Tielin Chen
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
14 years 3 months ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...
VLDB
2002
ACM
129views Database» more  VLDB 2002»
13 years 9 months ago
Optimizing View Queries in ROLEX to Support Navigable Result Trees
An increasing number of applications use XML data published from relational databases. For speed and convenience, such applications routinely cache this XML data locally and acces...
Philip Bohannon, Sumit Ganguly, Henry F. Korth, P....
FUIN
2010
143views more  FUIN 2010»
13 years 7 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer