Sciweavers

4539 search results - page 798 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CGF
2011
14 years 8 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
DAC
2000
ACM
16 years 5 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf
IPMI
2005
Springer
16 years 5 months ago
Spherical Navigator Registration Using Harmonic Analysis for Prospective Motion Correction
Spherical navigators are an attractive approach to motion compensation in Magnetic Resonance Imaging. Because they can be acquired quickly, spherical navigators have the potential ...
Christopher L. Wyatt, Narter Ari, Robert A. Kraft
KDD
2007
ACM
211views Data Mining» more  KDD 2007»
16 years 4 months ago
Enhanced max margin learning on multimodal data mining in a multimedia database
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and i...
Zhen Guo, Zhongfei Zhang, Eric P. Xing, Christos F...