Sciweavers

187 search results - page 11 / 38
» Coloring linear orders with Rado's partial order
Sort
View
DM
2006
91views more  DM 2006»
13 years 8 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
13 years 10 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
RIAO
2000
13 years 9 months ago
Combining linguistic and spatial information for document analysis
We present a framework to analyze color documents of complex layout. In addition, no assumption is made on the layout. Our framework combines in a content-driven bottom-up approac...
Marco Aiello, Christof Monz, Leon Todoran
ACL
2001
13 years 10 months ago
Topological Dependency Trees: A Constraint-Based Account of Linear Precedence
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
Denys Duchier, Ralph Debusmann
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 23 days ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan