26 search results - page 5 / 6 » Computation of minimal counterexamples by using black box te... |
JGO
2010
13 years 6 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
MVA
2010
13 years 5 days ago
2010
Studying ancient inscriptions is based up to date mostly on observation and manual analysis by means of which epigraphists attempt to establish a geographical and chronological cla...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...
IFM
2009
Springer
13 years 12 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...