Sciweavers

4313 search results - page 38 / 863
» Using time travel to diagnose computer problems
Sort
View
MEMOCODE
2006
IEEE
15 years 3 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
PAMI
2007
196views more  PAMI 2007»
14 years 9 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
AIPS
1994
14 years 11 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
DSN
2002
IEEE
15 years 2 months ago
Pinpoint: Problem Determination in Large, Dynamic Internet Services
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today’s large, distributed, and dynamic application e...
Mike Y. Chen, Emre Kiciman, Eugene Fratkin, Armand...
COCOA
2008
Springer
14 years 11 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia