Sciweavers

2597 search results - page 178 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 10 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ECAI
2008
Springer
15 years 8 months ago
SLIDE: A Useful Special Case of the CARDPATH Constraint
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
EVOW
2008
Springer
15 years 8 months ago
Artificial Creatures for Object Tracking and Segmentation
We present a study on the use of soft computing techniques for object tracking/segmentation in surveillance video clips. A number of artificial creatures, conceptually, "inhab...
Luca Mussi, Stefano Cagnoni
ACL
2007
15 years 8 months ago
Chinese Segmentation with a Word-Based Perceptron Algorithm
Standard approaches to Chinese word segmentation treat the problem as a tagging task, assigning labels to the characters in the sequence indicating whether the character marks a w...
Yue Zhang 0004, Stephen Clark
DLT
2007
15 years 8 months ago
Coding Partitions: Regularity, Maximality and Global Ambiguity
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In...
Marie-Pierre Béal, Fabio Burderi, Antonio R...