Sciweavers

4066 search results - page 64 / 814
» Almost Complete Sets
Sort
View
MICCAI
2005
Springer
14 years 3 months ago
Automatic 4-D Registration in Dynamic MR Renography Based on Over-Complete Dyadic Wavelet and Fourier Transforms
Dynamic contrast-enhanced 4-D MR renography has the potential for broad clinical applications, but suffers from respiratory motion that limits analysis and interpretation. Since ea...
Ting Song, Vivian S. Lee, Henry Rusinek, Manmeen K...
ECCV
2010
Springer
14 years 2 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
PATAT
2000
Springer
89views Education» more  PATAT 2000»
14 years 1 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
CORR
2010
Springer
238views Education» more  CORR 2010»
13 years 10 months ago
Face Identification by SIFT-based Complete Graph Topology
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...
Dakshina Ranjan Kisku, Ajita Rattani, Enrico Gross...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...