Sciweavers

1922 search results - page 344 / 385
» Computers and knowledge: a dialogical approach
Sort
View
PODC
2004
ACM
15 years 11 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
ECCV
2008
Springer
16 years 8 months ago
Robust 3D Pose Estimation and Efficient 2D Region-Based Segmentation from a 3D Shape Prior
In this work, we present an approach to jointly segment a rigid object in a 2D image and estimate its 3D pose, using the knowledge of a 3D model. We naturally couple the two proces...
Samuel Dambreville, Romeil Sandhu, Anthony J. Yezz...
CVPR
1998
IEEE
16 years 8 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
ICCV
2007
IEEE
16 years 8 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 6 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...