3244 search results - page 296 / 649 » On convex complexity measures |
386
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
174
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
168
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
In this work two distinct metrics are proposed, which aim to quantify the importance of a web page based on the visits it receives by the users and its location within the website...
174
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
176
click to vote
WISEC
2010
ACM
16 years 1 months ago
2010
ACM
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...