6045 search results - page 308 / 1209 » Computable Linearizations of Well-partial-orderings |
191
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
Abstract. We present a novel method for dimensionality reduction and recognition based on Linear Discriminant Analysis (LDA), which specifically deals with the Small Sample Size (S...
200
click to vote
ECCV
2000
Springer
16 years 9 months ago
2000
Springer
This paper considers a fundamental problem in visual motion perception, namely the problem of egomotion estimation based on visual input. Many of the existing techniques for solvin...
193
click to vote
DAC
2008
ACM
16 years 8 months ago
2008
ACM
In this paper we present an efficient algorithm for extracting the complete statistical distribution of the input impedance of interconnect structures in the presence of a large n...
201
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
236
click to vote
WEA
2010
Springer
16 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...