Sciweavers

4894 search results - page 665 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 5 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 5 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
ICPR
2008
IEEE
16 years 5 months ago
3D face recognition using sparse spherical representations
This paper addresses the problem of 3D face recognition using spherical sparse representations. We first propose a fully automated registration process that permits to align the 3...
Effrosini Kokiopoulou, Ivana Tosic, Pascal Frossar...
MICCAI
2009
Springer
16 years 5 months ago
Evaluation of q-Space Sampling Strategies for the Diffusion Magnetic Resonance Imaging
We address the problem of efficient sampling of the diffusion space for the Diffusion Magnetic Resonance Imaging (dMRI) modality. While recent scanner improvements enable the acqui...
Haz-Edine Assemlal, David Tschumperlé, Luc ...
ICML
2008
IEEE
16 years 4 months ago
Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs
Partially Observable Markov Decision Processes (POMDPs) have succeeded in planning domains that require balancing actions that increase an agent's knowledge and actions that ...
Finale Doshi, Joelle Pineau, Nicholas Roy