Sciweavers

5448 search results - page 1049 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 10 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SIGGRAPH
2010
ACM
15 years 10 months ago
Toward evaluating material design interface paradigms for novice users
Material design is the process by which artists specify the reflectance properties of a surface, such as its diffuse color and specular roughness. We present a user study to eval...
William B. Kerr, Fabio Pellacini
ECAI
1998
Springer
15 years 10 months ago
Diagnosis of Active Systems
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
Pietro Baroni, Gianfranco Lamperti, Paolo Pogliano...
FOCS
1997
IEEE
15 years 10 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
PLDI
1990
ACM
15 years 10 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
« Prev « First page 1049 / 1090 Last » Next »