4926 search results - page 102 / 986 » Two Graph Algorithms On an Associative Computing Model |
108
click to vote
ICTAI
2009
IEEE
15 years 9 months ago
2009
IEEE
Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics...
123
click to vote
WEA
2010
Springer
15 years 9 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
117
click to vote
ENDM
2006
15 years 2 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
116
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
148
Voted
SGP
2007
15 years 4 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...