811 search results - page 31 / 163 » An efficient algorithm for the configuration problem of domi... |
236
Voted
ICPR
2010
IEEE
16 years 5 days ago
2010
IEEE
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
158
click to vote
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
134
Voted
PVLDB
2010
15 years 2 days ago
2010
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
153
click to vote
EUROSYS
2007
ACM
15 years 9 months ago
2007
ACM
Recent research has found that operators frequently misconfigure Internet services, causing various availability and performance problems. In this paper, we propose a software inf...
129
click to vote
WEA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...