2957 search results - page 489 / 592 » The Complexity of Polynomial-Time Approximation |
150
Voted
ISCAS
2006
IEEE
15 years 11 months ago
2006
IEEE
— this paper presents a novel image feature extraction and recognition method two dimensional linear discriminant analysis (2DLDA) in a much smaller subspace. Image representatio...
140
click to vote
ELPUB
2006
ACM
15 years 11 months ago
2006
ACM
The paper presents in brief a methodology for development of tools for knowledge-based search in repositories of digitized manuscripts. It is designated to assist the search activ...
167
click to vote
SI3D
2006
ACM
15 years 11 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
170
click to vote
SIGIR
2006
ACM
15 years 11 months ago
2006
ACM
Search algorithms incorporating some form of topic model have a long history in information retrieval. For example, cluster-based retrieval has been studied since the 60s and has ...
163
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...