Sciweavers

71 search results - page 6 / 15
» Coxeter Lattice Paths
Sort
View
JCT
2011
108views more  JCT 2011»
14 years 4 months ago
The number of extreme points of tropical polyhedra
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
Xavier Allamigeon, Stéphane Gaubert, Ricard...
ICDAR
2011
IEEE
13 years 9 months ago
Trie-Lexicon-Driven Recognition for On-line Handwritten Japanese Disease Names Using a Time-Synchronous Method
— This paper describes a lexicon-driven approach to on-line handwritten Japanese disease name recognition using a time-synchronous method. A trie lexicon is constructed from a di...
Bilan Zhu, Masaki Nakagawa
90
Voted
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
15 years 1 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
DAC
2010
ACM
15 years 1 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
14 years 7 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev