3708 search results - page 723 / 742 » Approximating Betweenness Centrality |
120
click to vote
JMLR
2008
15 years 12 days ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
84
Voted
ECCC
2007
15 years 12 days ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
117
Voted
JPDC
2006
15 years 11 days ago
2006
Secure processor architectures enable new sets of applications such as commercial grid computing, software copy protection and secure mobile agents by providing secure computing e...
95
Voted
KAIS
2006
15 years 11 days ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
106
Voted
PAMI
2006
15 years 11 days ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...