Sciweavers

229 search results - page 33 / 46
» How Efficient Can Memory Checking Be
Sort
View
PVLDB
2008
117views more  PVLDB 2008»
13 years 6 months ago
Interactive source registration in community-oriented information integration
Modern Internet communities need to integrate and query structured information. Employing current information integration infrastructure, data integration is still a very costly e...
Yannis Katsis, Alin Deutsch, Yannis Papakonstantin...
ICCV
2009
IEEE
14 years 10 months ago
Radiometric Compensation using Stratified Inverses
Through radiometric compensation, a projector-camera system can project a desired image onto a non-flat and nonwhite surface. This can be achieved by computing the inverse light tr...
Tian-Tsong Ng, Ramanpreet S. Pahwa, Jiamin Bai, To...
BMVC
2010
13 years 5 months ago
Evaluation of dimensionality reduction methods for image auto-annotation
Image auto-annotation is a challenging task in computer vision. The goal of this task is to predict multiple words for generic images automatically. Recent state-of-theart methods...
Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi
DCC
1996
IEEE
13 years 11 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
IASTEDSE
2004
13 years 9 months ago
Mobile, on demand access of service-annotated 3D maps
The ever-increasing capabilities (processing power, memory, connectivity, display, etc.) of personal devices such as PDAs and mobile phones, as well as their convergence, have ena...
Michael Przybilski, Stefano Campadello, Titos Sari...