Sciweavers

3708 search results - page 723 / 742
» Approximating Betweenness Centrality
Sort
View
JMLR
2008
168views more  JMLR 2008»
13 years 8 months ago
Max-margin Classification of Data with Absent Features
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...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
ECCC
2007
86views more  ECCC 2007»
13 years 8 months ago
Testing Halfspaces
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 ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
JPDC
2006
141views more  JPDC 2006»
13 years 8 months ago
M-TREE: A high efficiency security architecture for protecting integrity and privacy of software
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...
Chenghuai Lu, Tao Zhang, Weidong Shi, Hsien-Hsin S...
KAIS
2006
126views more  KAIS 2006»
13 years 8 months ago
Fast and exact out-of-core and distributed k-means clustering
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 ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
PAMI
2006
132views more  PAMI 2006»
13 years 8 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
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...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...