10608 search results - page 1669 / 2122 » Complexity of O'Hara's Algorithm |
160
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...
165
click to vote
BMCBI
2008
15 years 5 months ago
2008
spectives. A total of 149 abstracts were accepted and presented in the poster session and 31 of them were selected for oral presentation. At the opening of the meeting, Roderic Gui...
158
Voted
COMGEO
2010
ACM
15 years 5 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
161
click to vote
CGF
2008
15 years 5 months ago
2008
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
134
Voted
FUIN
2008
15 years 5 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...