Sciweavers

968 search results - page 56 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
RIAO
2007
13 years 11 months ago
An Information Retrieval Driven by Ontology: from Query to Document Expansion
The paper proposes an approach to information retrieval based on the use of a structure (ontology) both for document (resp. query) indexing and query evaluating. The conceptual st...
Mustapha Baziz, Mohand Boughanem, Gabriella Pasi, ...
SMI
2008
IEEE
181views Image Analysis» more  SMI 2008»
14 years 4 months ago
SHREC - 08 entry: Local 2D visual features for CAD Model retrieval
A local shape feature has an advantage in dealing with deformable or articulated 3D models. We evaluate the performance of our local, 2D visual features and their integration meth...
Kunio Osada, Takahiko Furuya, Ryutarou Ohbuchi
ICTAI
2006
IEEE
14 years 4 months ago
Intelligent Neighborhood Exploration in Local Search Heuristics
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
Isabelle Devarenne, Hakim Mabed, Alexandre Caminad...
3DPVT
2006
IEEE
183views Visualization» more  3DPVT 2006»
14 years 4 months ago
High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming
We present a stereo algorithm that achieves high quality results while maintaining real-time performance. The key idea is simple: we introduce an adaptive aggregation step in a dy...
Liang Wang, Miao Liao, Minglun Gong, Ruigang Yang,...
BMCBI
2006
114views more  BMCBI 2006»
13 years 10 months ago
A high level interface to SCOP and ASTRAL implemented in Python
Background: Benchmarking algorithms in structural bioinformatics often involves the construction of datasets of proteins with given sequence and structural properties. The SCOP da...
James A. Casbon, Gavin E. Crooks, Mansoor A. S. Sa...