Sciweavers

199 search results - page 15 / 40
» Higher-Order Critical Pairs
Sort
View
EOR
2007
198views more  EOR 2007»
13 years 7 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
NN
2006
Springer
126views Neural Networks» more  NN 2006»
13 years 7 months ago
Selective attention through phase relationship of excitatory and inhibitory input synchrony in a model cortical neuron
Neurons in area V 2 and V 4 exhibit stimulus specific tuning to single stimuli, and respond at intermediate firing rates when presented with two differentially preferred stimuli (...
Jyoti Mishra, Jean-Marc Fellous, Terrence J. Sejno...
VIS
2007
IEEE
120views Visualization» more  VIS 2007»
14 years 9 months ago
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
Attila Gyulassy, Vijay Natarajan, Valerio Pascuc...
COMPGEOM
2001
ACM
13 years 11 months ago
Hierarchical morse complexes for piecewise linear 2-manifolds
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
Herbert Edelsbrunner, John Harer, Afra Zomorodian
JSC
2007
152views more  JSC 2007»
13 years 7 months ago
Complete involutive rewriting systems
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
Gareth A. Evans, Christopher D. Wensley