Sciweavers

6045 search results - page 344 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TNN
2008
90views more  TNN 2008»
15 years 7 months ago
Shared Feature Extraction for Nearest Neighbor Face Recognition
In this paper, we propose a new supervised linear feature extraction technique for multiclass classification problems that is specially suited to the nearest neighbor classifier (N...
David Masip, Jordi Vitrià
ICFP
2007
ACM
16 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 7 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert
PR
2008
132views more  PR 2008»
15 years 7 months ago
Measuring linearity of planar point sets
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
Milos Stojmenovic, Amiya Nayak, Jovisa D. Zunic
COMPGEOM
2005
ACM
15 years 9 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel