Sciweavers

1461 search results - page 164 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
AAAI
1994
15 years 7 months ago
Case-Based Acquisition of User Preferences for Solution Improvement in Ill-Structured Domains
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
Katia P. Sycara, Kazuo Miyashita
MM
2010
ACM
127views Multimedia» more  MM 2010»
15 years 6 months ago
Mining and cropping common objects from images
Discovering common objects that appear frequently in a number of images is a challenging problem, due to (1) the appearance variations of the same common object and (2) the enormo...
Gangqiang Zhao, Junsong Yuan
CGF
2010
147views more  CGF 2010»
15 years 6 months ago
Resampling Strategies for Deforming MLS Surfaces
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
Joao Paulo Gois, Gustavo C. Buscaglia
IJACT
2008
136views more  IJACT 2008»
15 years 6 months ago
Anonymous RFID authentication supporting constant-cost key-lookup against active adversaries
: In the absence of sufficiently optimised public key constructions, anonymous authentication for Radio-Frequency Identification Devices (RFIDs) requires state synchronisation betw...
Mike Burmester, Breno de Medeiros, Rossana Motta
ISCI
2008
116views more  ISCI 2008»
15 years 6 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu