Sciweavers

303 search results - page 18 / 61
» Update Algorithms for the Sketch Data Model
Sort
View
ANSS
1995
IEEE
15 years 8 months ago
Algorithms for categorizing multiprocessor communication under invalidate and update-based coherence protocols
In this paper we present simulation algorithmsthat characterize the main sources of communication generated by parallel applications under both invalidate and updatebased cache co...
Ricardo Bianchini, Leonidas I. Kontothanassis
ICALP
2009
Springer
16 years 4 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
AMAST
2004
Springer
15 years 9 months ago
On Guard: Producing Run-Time Checks from Integrity Constraints
Abstract. Software applications are inevitably concerned with data integrity, whether the data is stored in a database, files, or program memory. An integrity guard is code execut...
Michael Benedikt, Glenn Bruns
SIGMOD
2002
ACM
177views Database» more  SIGMOD 2002»
16 years 4 months ago
Coordinating backup/recovery and data consistency between database and file systems
Managing a combined store consisting of database data and file data in a robust and consistent manner is a challenge for database systems and content management systems. In such a...
Suparna Bhattacharya, C. Mohan, Karen Brannon, Ind...
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 4 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...