3370 search results - page 582 / 674 » Correlation Embedding Analysis |
188
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
164
click to vote
SAMOS
2009
Springer
15 years 10 months ago
2009
Springer
The demands for high quality, real-time performance and multi-format video support in consumer multimedia products are ever increasing. In particular, the future multimedia systems...
138
click to vote
COCOON
2001
Springer
15 years 10 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
154
click to vote
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients...
188
click to vote
AFPAC
2000
Springer
15 years 10 months ago
2000
Springer
In signal processing, the approach of the analytic signal is a capable and often used method. For signals of finite length, quadrature filters yield a bandpass filtered approxim...