Sciweavers

2814 search results - page 503 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
DKE
2006
123views more  DKE 2006»
13 years 8 months ago
Cost models for distance joins queries using R-trees
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....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
FOCM
2006
97views more  FOCM 2006»
13 years 8 months ago
Learning Rates of Least-Square Regularized Regression
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...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
JMM2
2006
149views more  JMM2 2006»
13 years 8 months ago
Invariant Robust 3-D Face Recognition based on the Hilbert Transform in Spectral Space
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...
Eric Paquet, Marc Rioux
IPM
2007
158views more  IPM 2007»
13 years 8 months ago
Validation and interpretation of Web users' sessions clusters
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...
George Pallis, Lefteris Angelis, Athena Vakali
TON
2002
109views more  TON 2002»
13 years 8 months ago
Coordinated multihop scheduling: a framework for end-to-end services
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...
Chengzhi Li, Edward W. Knightly