Sciweavers

1632 search results - page 19 / 327
» On special numberings of hypergraphs
Sort
View
COLOGNETWENTE
2008
15 years 7 months ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
TIT
2002
82views more  TIT 2002»
15 years 5 months ago
Order estimation for a special class of hidden Markov sources and binary renewal processes
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
Sanjeev Khudanpur, Prakash Narayan
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 10 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
SAS
2000
Springer
124views Formal Methods» more  SAS 2000»
15 years 9 months ago
Code Specialization Based on Value Profiles
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
Robert Muth, Scott A. Watterson, Saumya K. Debray
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
16 years 22 days ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer