1816 search results - page 66 / 364 » A New Approach for Solving the Maximum Clique Problem |
179
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are c...
168
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
137
Voted
ICASSP
2009
IEEE
16 years 20 days ago
2009
IEEE
We consider the problem of Time Difference of Arrival (TDOA) estimation for cyclostationary signals in additive white Gaussian noise. Classical approaches to the problem either ig...
156
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
160
click to vote
DAC
2005
ACM
16 years 6 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...