141 search results - page 14 / 29 » Destruction of Very Simple Trees |
SDM
2010
SIAM
15 years 1 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
167
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
COCOON
2009
Springer
15 years 6 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...
107
click to vote
ICNP
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the problem of distributing “live” streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attr...