4926 search results - page 111 / 986 » Two Graph Algorithms On an Associative Computing Model |
139
click to vote
ISCC
1999
IEEE
15 years 6 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
123
Voted
SIGGRAPH
2000
ACM
15 years 6 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
117
click to vote
DAC
1999
ACM
16 years 3 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
119
click to vote
WSC
2007
15 years 4 months ago
2007
Much of the rare-event simulation literature is concerned with the development of asymptotically optimal algorithms. Because of the difficulties associated with applying these id...
121
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...