3020 search results - page 317 / 604 » Optimal partition trees |
174
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
The result of a scene manipulation is usually displayed by rerendering the entire image even if the change has affected only a small portion of it. This paper presents a system th...
164
click to vote
ICLP
1992
Springer
15 years 10 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
169
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
148
click to vote
EOR
2008
15 years 6 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
145
click to vote
ARITH
2003
IEEE
15 years 12 months ago
2003
IEEE
We propose a split array multiplier organized in a left-to-right leapfrog (LRLF) structure with reduced delay compared to conventional array multipliers. Moreover, the proposed de...