1816 search results - page 129 / 364 » A New Approach for Solving the Maximum Clique Problem |
159
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
170
click to vote
IJCAI
2007
15 years 7 months ago
2007
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
172
click to vote
MIAR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
209
click to vote
TEC
2010
15 years 1 months ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
204
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...