Sciweavers

1208 search results - page 157 / 242
» On Counting Generalized Colorings
Sort
View
JAL
1998
85views more  JAL 1998»
14 years 10 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
ICS
2010
Tsinghua U.
14 years 8 months ago
An approach to resource-aware co-scheduling for CMPs
We develop real-time scheduling techniques for improving performance and energy for multiprogrammed workloads that scale nonuniformly with increasing thread counts. Multithreaded ...
Major Bhadauria, Sally A. McKee
KBSE
2010
IEEE
14 years 8 months ago
Reducing estimation uncertainty with continuous assessment: tracking the "cone of uncertainty"
Accurate software cost and schedule estimations are essential especially for large software projects. However, once the required efforts have been estimated, little is done to rec...
Pongtip Aroonvatanaporn, Chatchai Sinthop, Barry W...
LICS
2010
IEEE
14 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
91
Voted
PAMI
2010
113views more  PAMI 2010»
14 years 8 months ago
Hierarchical Bayesian Modeling of Topics in Time-Stamped Documents
—We consider the problem of inferring and modeling topics in a sequence of documents with known publication dates. The documents at a given time are each characterized by a topic...
Iulian Pruteanu-Malinici, Lu Ren, John William Pai...