482 search results - page 75 / 97 » A Linear-Time Graph Kernel |
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
TC
2008
14 years 9 months ago
2008
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
GMP
2006
IEEE
15 years 3 months ago
2006
IEEE
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...