400 search results - page 26 / 80 » Hard Problem Generation for MKP |
116
click to vote
APVIS
2004
15 years 2 months ago
2004
Program traces can be used to drive visualisations of reusable components, but such traces can be gigabytes in size, are very expensive to generate, and are hard to extract inform...
GRAPHICSINTERFACE
2000
15 years 2 months ago
2000
In this paper we introduce a simple and efficient scheme for encodingthe connectivityand the stripification of a triangle mesh. Since generating a good set of triangle strips is a...
121
Voted
GFKL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
104
Voted
DCC
2001
IEEE
16 years 8 days ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
94
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...