Sciweavers

3820 search results - page 231 / 764
» Bounded Model Debugging
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 5 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
101
Voted
ICCV
2009
IEEE
16 years 8 months ago
Feature-Centric Efficient Subwindow Search
embedded in a sliding-window scheme. Such exhaustive search involves massive computation. Efficient Subwindow Search (ESS) [11] avoids this by means of branch and bound. However...
Alain Lehmann, Bastian Leibe, Luc van Gool
77
Voted
ICPR
2002
IEEE
16 years 4 months ago
An Iterative Algorithm for Optimal Style Conscious Field Classification
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...
Prateek Sarkar
117
Voted
ICML
2008
IEEE
16 years 4 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
148
Voted
ICDAR
2009
IEEE
15 years 10 months ago
A Probabilistic Framework for Soft Target Learning in Online Cursive Handwriting Recognition
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...
Xiaoyuan Zhu, Yong Ge, Feng-Jun Guo, Li-Xin Zhen