Sciweavers

134 search results - page 10 / 27
» A note on generalized chromatic number and generalized girth
Sort
View
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
TOMACS
1998
140views more  TOMACS 1998»
13 years 7 months ago
Technical Note: A Hierarchical Computer Architecture Design and Simulation Environment
architectures at multiple levels of abstraction, encompassing both hardware and software. It has five modes of operation (Design, Model Validation, Build Simulation, Simulate Syste...
Paul S. Coe, Fred W. Howell, Roland N. Ibbett, Lau...
CSDA
2002
77views more  CSDA 2002»
13 years 7 months ago
Numerically stable cointegration analysis
Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computa...
Jurgen A. Doornik, R. J. O'Brien
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
UIST
2004
ACM
14 years 1 months ago
ScreenCrayons: annotating anything
ScreenCrayons is a system for collecting annotations on any type of document or visual information from any application. The basis for the system is a screen capture upon which th...
Dan R. Olsen, Trent Taufer, Jerry Alan Fails