Sciweavers

71 search results - page 12 / 15
» Coxeter Lattice Paths
Sort
View
107
Voted
CPC
2002
75views more  CPC 2002»
15 years 3 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel
JCT
2011
141views more  JCT 2011»
14 years 10 months ago
Bijections for Baxter families and related objects
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
Stefan Felsner, Éric Fusy, Marc Noy, David ...
160
Voted
PR
2011
14 years 10 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
118
Voted
CVPR
2001
IEEE
16 years 5 months ago
Temporal Integration of Multiple Silhouette-Based Body-Part Hypotheses
A method for temporally integrating appearance-based body-part labelling is presented. We begin by modifying the silhouette labelling method of Ghost[4]; that system first determi...
Vivek Kwatra, Aaron F. Bobick, Amos Y. Johnson
130
Voted
WSC
2004
15 years 5 months ago
Simulation-Based Pricing of Mortgage-Backed Securities
Mortgage-Backed-Securities (MBS), as the largest investment class of fixed income securities, have always been hard to price. Because of the following reasons, normal numerical me...
Jian Chen