Sciweavers

87 search results - page 17 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
JMLR
2008
230views more  JMLR 2008»
15 years 4 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
CVPR
2008
IEEE
16 years 6 months ago
Extracting a fluid dynamic texture and the background from video
Given the video of a still background occluded by a fluid dynamic texture (FDT), this paper addresses the problem of separating the video sequence into its two constituent layers....
Bernard Ghanem, Narendra Ahuja
COMPGEOM
2010
ACM
15 years 9 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
IJAC
2006
93views more  IJAC 2006»
15 years 4 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest
BMCBI
2006
138views more  BMCBI 2006»
15 years 4 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...