1816 search results - page 283 / 364 » A New Approach for Solving the Maximum Clique Problem |
176
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
168
click to vote
ASPDAC
2005
ACM
15 years 12 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
204
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of ef...
168
click to vote
FAST
2008
15 years 8 months ago
2008
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...