186 search results - page 2 / 38 » Speeding up algorithms on compressed web graphs |
PARA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
CPM
2007
Springer
13 years 10 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
WEA
2005
Springer
13 years 10 months ago
2005
Springer
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
SIGSOFT
1994
ACM
13 years 8 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...