Sciweavers

212 search results - page 26 / 43
» On Lengths of Rainbow Cycles
Sort
View
UAI
2000
13 years 11 months ago
Building a Stochastic Dynamic Model of Application Use
Many intelligent user interfaces employ application and user models to determine the user's preferences, goals and likely future actions. Such models require application anal...
Peter Gorniak, David Poole
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 9 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
CCE
2004
13 years 9 months ago
Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
Dan Wu, Marianthi G. Ierapetritou
PAMI
2010
245views more  PAMI 2010»
13 years 8 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
JCT
2011
86views more  JCT 2011»
13 years 4 months ago
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu