2372 search results - page 447 / 475 » Probabilistic calling context |
SIGSOFT
1998
ACM
13 years 12 months ago
1998
ACM
Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding. However, the representations constructed by these tool...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
ICDT
2010
ACM
13 years 12 months ago
2010
ACM
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
WG
1994
Springer
13 years 11 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
PKC
2010
Springer
13 years 11 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...