Sciweavers

13987 search results - page 420 / 2798
» The Two Guards Problem
Sort
View
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 8 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 6 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
PAMI
2007
131views more  PAMI 2007»
15 years 6 months ago
Photo-Consistent Reconstruction of Semitransparent Scenes by Density-Sheet Decomposition
—This paper considers the problem of reconstructing visually realistic 3D models of dynamic semitransparent scenes, such as fire, from a very small set of simultaneous views (eve...
Samuel W. Hasinoff, Kiriakos N. Kutulakos
GAMESEC
2010
150views Game Theory» more  GAMESEC 2010»
15 years 4 months ago
Adversarial Control in a Delay Tolerant Network
We consider a multi-criteria control problem that arises in a delay tolerant network with two adversarial controllers: the source and the jammer. The source's objective is to ...
Eitan Altman, Tamer Basar, Veeraruna Kavitha
JMLR
2010
101views more  JMLR 2010»
15 years 1 months ago
Efficient Reductions for Imitation Learning
Imitation Learning, while applied successfully on many large real-world problems, is typically addressed as a standard supervised learning problem, where it is assumed the trainin...
Stéphane Ross, Drew Bagnell