Sciweavers

364 search results - page 38 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
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...
Patrick Baillot, Marco Pedicini
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 7 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
GLOBECOM
2006
IEEE
14 years 1 months ago
Improved High-rate Space-Time-Frequency Block Codes
— 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...
Jinsong Wu, Steven D. Blostein
ICMLA
2007
13 years 8 months ago
Scalable optimal linear representation for face and object recognition
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...
Yiming Wu, Xiuwen Liu, Washington Mio
COMGEO
2007
ACM
13 years 7 months ago
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
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...
Daniel Freedman