18306 search results - page 211 / 3662 » Algorithmics in Exponential Time |
112
Voted
ISAAC
1995
Springer
15 years 6 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
117
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
102
Voted
CATS
2007
15 years 4 months ago
2007
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
106
click to vote
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we present a new method for mapping a natural speech to the lip shape animation in the real time. The speech signal, represented by MFCC vectors, is classified into ...