Sciweavers

5329 search results - page 660 / 1066
» The Weighted Majority Algorithm
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
16 years 3 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
3DIM
2003
IEEE
16 years 1 days ago
Effective Nearest Neighbor Search for Aligning and Merging Range Images
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
Ryusuke Sagawa, Tomohito Masuda, Katsushi Ikeuchi
MIR
2003
ACM
113views Multimedia» more  MIR 2003»
15 years 12 months ago
Semantic-meaningful content-based image retrieval in wavelet domain
In this paper, we propose a semantic-meaningful approach for region-based image retrieval in image database. Our retrieval system is based on wavelet transform for its decompositi...
Yongqing Sun, Shinji Ozawa
ADC
2003
Springer
118views Database» more  ADC 2003»
15 years 12 months ago
CrystalBall : A Framework for Mining Variants of Association Rules
The mining of informative rules calls for methods that include different attributes (e.g., weights, quantities, multipleconcepts) suitable for the context of the problem to be an...
Kok-Leong Ong, Wee Keong Ng, Ee-Peng Lim
CIAC
2003
Springer
110views Algorithms» more  CIAC 2003»
15 years 12 months ago
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
Euripides Markou, Stathis Zachos, Christodoulos Fr...