3020 search results - page 241 / 604 » Optimal partition trees |
145
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
163
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
180
click to vote
ICALP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
166
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
199
click to vote
IDEAS
2008
IEEE
16 years 1 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...