340 search results - page 66 / 68 » Clustering with Lower Bound on Similarity |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this study, we employed our recently developed iterative independent component analysis (iICA) procedure to measure single-trial EPs from auditory N100 recordings of 21 normal ...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...