Sciweavers

3172 search results - page 21 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ISJ
1998
82views more  ISJ 1998»
13 years 10 months ago
Successfully completing case study research: combining rigour, relevance and pragmatism
The organizational and social issues associated with the development, implementation and use of computer-based information systems have increasingly attracted the attention of info...
Peta Darke, Graeme G. Shanks, Marianne Broadbent
TKDE
2010
168views more  TKDE 2010»
13 years 9 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
MICCAI
2005
Springer
14 years 4 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 3 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...
CSCW
2002
ACM
13 years 10 months ago
Who can claim complete abstinence from peeking at print jobs?
While systems supporting communities of practice in work organizations have been shown to be desirable many, if not all, are decoupled from daily work practices and tools. This hi...
Antonietta Grasso, Jean-Luc Meunier