14078 search results - page 366 / 2816 » Design and Analysis of Computer Algorithms |
196
click to vote
IWPEC
2004
Springer
16 years 4 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
179
click to vote
AIPS
2006
15 years 8 months ago
2006
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
169
Voted
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
198
click to vote
TOG
2008
15 years 6 months ago
2008
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
174
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
Many websites use tags as a mechanism for improving item metadata through collective user effort. Users of tagging systems often apply far more tags to an item than a system can ...