364 search results - page 38 / 73 » Dimension Characterizations of Complexity Classes |
101
Voted
CORR
2006
Springer
15 years 17 days ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
ALGORITHMICA
2004
15 years 13 days ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
96
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— High-rate space-time-frequency block codes (STFBC) are promising for achieving high bandwidth efficiency, low overhead and latency. Recently, a class of low-complexity STFBC m...
95
Voted
ICMLA
2007
15 years 2 months ago
2007
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
96
Voted
COMGEO
2007
ACM
15 years 16 days ago
2007
ACM
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...