2219 search results - page 114 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
124
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
113
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
120
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
142
click to vote
SIGIR
2003
ACM
15 years 7 months ago
2003
ACM
This paper presents a novel domain-independent text segmentation method, which identifies the boundaries of topic changes in long text documents and/or text streams. The method c...
105
Voted
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
A scene can be defined as one of the subdivisions of a play in which the setting is fixed, or when it presents continuous action in one place. We propose a novel two-pass algorith...