Sciweavers

1445 search results - page 102 / 289
» Uniformly Hard Languages
Sort
View
133
Voted
GD
2006
Springer
15 years 7 months ago
The Website for Graph Visualization Software References (GVSR)
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
Bruno Pinaud, Pascale Kuntz, Fabien Picarougne
156
Voted
COMGEO
2007
ACM
15 years 3 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
138
Voted
KI
2008
Springer
15 years 3 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
170
Voted
MST
2010
187views more  MST 2010»
14 years 10 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
154
Voted
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
13 years 6 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns