6575 search results - page 425 / 1315 » Specializing visualization algorithms |
160
click to vote
ISAAC
2005
Springer
16 years 11 days ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
195
click to vote
ICDM
2005
IEEE
16 years 14 days ago
2005
IEEE
We study an algorithm for feature selection that clusters attributes using a special metric and then makes use of the dendrogram of the resulting cluster hierarchy to choose the m...
156
Voted
ICMCS
2005
IEEE
16 years 14 days ago
2005
IEEE
Sports video processing is an interesting topic for research, since the clearly defined game rules in sports provide the rich domain knowledge for analysis. Moreover, it is intere...
132
click to vote
CP
2003
Springer
16 years 3 days ago
2003
Springer
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
153
click to vote
FCS
2006
15 years 8 months ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...