Sciweavers

822 search results - page 60 / 165
» Descendants in Increasing Trees
Sort
View
DAC
2006
ACM
14 years 11 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
IDEAL
2007
Springer
14 years 4 months ago
Topological Tree Clustering of Social Network Search Results
In the information age, online collaboration and social networks are of increasing importance and quickly becoming an integral part of our lifestyle. In business, social networking...
Richard T. Freeman
MSR
2006
ACM
14 years 4 months ago
Predicting defect densities in source code files with decision tree learners
With the advent of open source software repositories the data available for defect prediction in source files increased tremendously. Although traditional statistics turned out t...
Patrick Knab, Martin Pinzger, Abraham Bernstein
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
14 years 3 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
IS
2011
13 years 5 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...