Sciweavers

203 search results - page 27 / 41
» Improved undecidability results on weighted timed automata
Sort
View
ICCVG
2010
14 years 11 months ago
Visual Codebooks Survey for Video On-Line Processing
Abstract. This paper explores techniques in the pipeline of image description based on visual codebooks suitable for video on-line processing. The pipeline components are (i) extra...
Vítezslav Beran, Pavel Zemcík
SIGIR
1995
ACM
15 years 1 months ago
Probability Kinematics in Information Retrieval
We analyse the kinematics of probabilistic term weights at retrieval time for di erent Information Retrieval models. We present four models based on di erent notions of probabilis...
Fabio Crestani, C. J. van Rijsbergen
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 2 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
JMLR
2006
389views more  JMLR 2006»
14 years 9 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...
ISQED
2006
IEEE
116views Hardware» more  ISQED 2006»
15 years 3 months ago
Probabilistic Delay Budgeting for Soft Realtime Applications
Unlike their hard realtime counterparts, soft realtime applications are only expected to guarantee their ”expected delay” over input data space. This paradigm shift calls for ...
Soheil Ghiasi, Po-Kuan Huang