617 search results - page 84 / 124 » On the Chromatic Number of Random Graphs |
111
click to vote
DAM
2000
14 years 11 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
109
click to vote
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
HIPEAC
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...
125
click to vote
AI
1998
Springer
14 years 11 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...