Sciweavers

40 search results - page 2 / 8
» From bounded to unbounded concurrency objects and back
Sort
View
CVPR
2009
IEEE
14 years 12 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
PODC
1997
ACM
13 years 9 months ago
Collecting Distributed Garbage Cycles by Back Tracing
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
Umesh Maheshwari, Barbara Liskov
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
13 years 10 months ago
Numeric Domains with Summarized Dimensions
We introduce a systematic approach to designing summarizing abstract numeric domains from existing numeric domains. Summarizing domains use summary dimensions to represent potentia...
Denis Gopan, Frank DiMaio, Nurit Dor, Thomas W. Re...
JACM
2002
87views more  JACM 2002»
13 years 4 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi
VMCAI
2009
Springer
13 years 11 months ago
Finding Concurrency-Related Bugs Using Random Isolation
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
Nicholas Kidd, Thomas W. Reps, Julian Dolby, Manda...