263 search results - page 50 / 53 » Minimum Entropy Coloring |
113
click to vote
TOG
2002
14 years 11 months ago
2002
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
100
click to vote
KDD
2009
ACM
16 years 6 days ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
179
Voted
PODS
2009
ACM
16 years 6 days ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
108
click to vote
ESANN
2004
15 years 1 months ago
2004
The twin of this paper, "Forbidden Magnification? I." [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann ...
JACM
2000
14 years 11 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...