Sciweavers

1709 search results - page 157 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
SIMUTOOLS
2008
15 years 7 months ago
An OMNeT++ model for the evaluation of OBS routing strategies
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
A. L. Barradas, M. C. R. Medeiros
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 6 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...
ECCV
2002
Springer
16 years 8 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 7 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
PAMI
2011
15 years 1 months ago
Color Constancy Using Natural Image Statistics and Scene Semantics
—Existing color constancy methods are all based on specific assumptions such as the spatial and spectral characteristics of images. As a consequence, no algorithm can be conside...
Arjan Gijsenij, Theo Gevers