4131 search results - page 351 / 827 » Compactness in Topology and Computation |
209
click to vote
ANCS
2006
ACM
16 years 22 days ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
195
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
150
click to vote
PR
2007
15 years 6 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
161
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
171
click to vote
PG
2007
IEEE
16 years 1 months ago
2007
IEEE
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...