Sciweavers

439 search results - page 88 / 88
» Weighted decomposition kernels
Sort
View
ECML
2004
Springer
13 years 10 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
VISUALIZATION
1999
IEEE
13 years 9 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
ICALP
2010
Springer
13 years 7 months ago
The Cooperative Game Theory Foundations of Network Bargaining Games
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...
PR
2010
126views more  PR 2010»
13 years 3 months ago
Discriminability and reliability indexes: Two new measures to enhance multi-image face recognition
In order to handle complex face image variations in face recognition, multi-image face recognition has been proposed, instead of using a single still-imagebased approach. In many ...
Weiwen Zou, Pong C. Yuen