3155 search results - page 371 / 631 » An algorithm for optimal difference systems of sets |
195
click to vote
PRL
2006
15 years 6 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
168
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
181
click to vote
ATMOS
2007
15 years 8 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
161
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
We present a formal description of a neurofuzzy system capable of aligning two sequences recognizing their internal structure. The alignment is done on two levels: grouping of the...
150
click to vote
GIS
1995
ACM
15 years 10 months ago
1995
ACM
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...