8728 search results - page 357 / 1746 » On Reduct Construction Algorithms |
167
click to vote
PLDI
2004
ACM
16 years 6 days ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
176
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
186
click to vote
JCP
2007
15 years 6 months ago
2007
Abstract— Analyzing unknown data sets such as multispectral images often requires unsupervised techniques. Data clustering is a well known and widely used approach in such cases....
204
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
174
click to vote
SPIRE
2000
Springer
15 years 10 months ago
2000
Springer
This paper describes a word stemming algorithm for the Spanish Language. Experiments in document retrieval regarding English text suggest that word stemming based on morphological...