2814 search results - page 503 / 563 » Competitive Analysis of Distributed Algorithms |
114
Voted
DKE
2006
15 years 26 days ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
130
Voted
FOCM
2006
15 years 25 days ago
2006
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
110
Voted
JMM2
2006
15 years 24 days ago
2006
One of the main objectives of face recognition is to determine whether an acquired face belongs to a reference database and to subsequently identify the corresponding individual. F...
126
Voted
IPM
2007
15 years 22 days ago
2007
Understanding users’ navigation on the Web is important towards improving the quality of information and the speed of accessing large-scale Web data sources. Clustering of users...
84
Voted
TON
2002
15 years 14 days ago
2002
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...