2314 search results - page 355 / 463 » Minimal Partitions of a Graph |
120
Voted
DAC
2005
ACM
15 years 5 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
138
Voted
AAAI
2010
15 years 5 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
147
click to vote
BDA
2007
15 years 5 months ago
2007
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
138
Voted
ICVGIP
2008
15 years 5 months ago
2008
In recent years, the subject of occlusion culling of large 3D environments has received substantial contribution. However the major amount of research into the area has focussed o...
132
Voted
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...