108 search results - page 4 / 22 » Exact Exploration and Hanging Algorithms |
ICFCA
2007
Springer
14 years 1 months ago
2007
Springer
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
BMCBI
2007
13 years 7 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
COMPGEOM
2008
ACM
13 years 8 months ago
2008
ACM
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...