Sciweavers

3356 search results - page 184 / 672
» Determining Consensus Numbers
Sort
View
RSA
2011
89views more  RSA 2011»
15 years 1 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
JCIT
2010
106views more  JCIT 2010»
15 years 29 days ago
Clearing Policy for an Specialist Agent in Marketing Strategies
This work discusses clearing policy used by a specialist agent on marketing strategies under the rules of TAC CAT agents International Tournament. The goal of this agent is to cre...
Miriam Salcedo H., Darnes Vilarino A., Fabiola Lop...
187
Voted
JMLR
2010
218views more  JMLR 2010»
15 years 28 days ago
Simple Exponential Family PCA
Bayesian principal component analysis (BPCA), a probabilistic reformulation of PCA with Bayesian model selection, is a systematic approach to determining the number of essential p...
Jun Li, Dacheng Tao
JSYML
2010
95views more  JSYML 2010»
15 years 28 days ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
205
Voted
PPOPP
2011
ACM
14 years 9 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...