1554 search results - page 213 / 311 » Parameterized Complexity and Approximation Algorithms |
108
click to vote
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
128
click to vote
RECOMB
2008
Springer
16 years 3 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
113
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
128
click to vote
EDUTAINMENT
2007
Springer
15 years 9 months ago
2007
Springer
Due to the high-dimensionality of motion captured data which resulted in the complexity in motion analysis, a method of motion data processing based on manifold learning was propos...
123
click to vote
ISNN
2007
Springer
15 years 9 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...