Sciweavers

1487 search results - page 230 / 298
» The Computational Complexity of Link Building
Sort
View
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 7 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
PG
2003
IEEE
15 years 6 months ago
Breaking the Walls: Scene Partitioning and Portal Creation
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
Alon Lerner, Yiorgos Chrysanthou, Daniel Cohen-Or
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 6 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
ECBS
1996
IEEE
155views Hardware» more  ECBS 1996»
15 years 5 months ago
Model-Integrated Program Synthesis Environment
In this paper, it is shown that, through the use of Model-Integrated Program Synthesis MIPS, parallel real-time implementations of image processing data ows can be synthesized fro...
Janos Sztipanovits, Gabor Karsai, Hubertus Franke
WSC
1997
15 years 2 months ago
MODSIM III - A Tutorial
This tutorial introduces the MODSIM III language, showing how its simulation "world view" together with its object-oriented architecture and built in graphics contribute...
John Goble