1162 search results - page 179 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
JMLR
2010
13 years 2 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...