Sciweavers

1326 search results - page 151 / 266
» Approximate Tree Kernels
Sort
View
NETWORKING
2011
13 years 16 days ago
Modelling and Evaluation of CCN-Caching Trees
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei ...
FOCS
2008
IEEE
14 years 4 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
CGI
2000
IEEE
14 years 2 months ago
Reconstruction of B-spline Surfaces from Scattered Data Points
We present a new approach for reconstructing a smooth surface from a set of scattered points in three-dimensional (3D) space. Our algorithm first decomposes a given point set int...
Benjamin F. Gregorski, Bernd Hamann, Kenneth I. Jo...
CVPR
2004
IEEE
14 years 11 months ago
Shaping Receptive Fields for Affine Invariance
The Gaussian kernel has played a central role in multi-scale methods for feature extraction and matching. In this paper, a method for shaping the filter using the local image stru...
S. Ravela
ICCV
2005
IEEE
14 years 3 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua