308 search results - page 37 / 62 » How Fast Is the k-Means Method |
156
Voted
ACSC
2006
IEEE
15 years 9 months ago
2006
IEEE
Visual data mining has been established to effectively analyze large, complex numerical data sets. Especially, the extraction and visualization of inherent structures such as hie...
130
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
128
Voted
IMC
2003
ACM
15 years 8 months ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
139
Voted
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
132
Voted
FM
2006
Springer
15 years 7 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...