Sciweavers

685 search results - page 69 / 137
» Closure Operators for Order Structures
Sort
View
PODC
2003
ACM
15 years 7 months ago
Split-ordered lists: lock-free extensible hash tables
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
Ori Shalev, Nir Shavit
144
Voted
MIS
2001
Springer
151views Multimedia» more  MIS 2001»
15 years 7 months ago
A Data Model for Querying Wavelet Features in Image Databases
Multimedia databases deal with storage and retrieval of complex descriptors of image contents, called features. Traditional techniques consider features as “black boxes,” ofte...
Simone Santini, Amarnath Gupta
PLDI
1996
ACM
15 years 6 months ago
Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers
This paper presents a new analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutat...
Martin C. Rinard, Pedro C. Diniz
CTW
2006
88views more  CTW 2006»
15 years 2 months ago
Using multiple cognitive task analysis methods for supervisory control interface design in high-throughput biological screening
Cognitive task analysis (CTA) approaches are currently needed in many domains to provide explicit guidance on redesigning existing systems. This study used goal-directed task analy...
David B. Kaber, Noa Segall, Rebecca S. Green, K. E...
145
Voted
JOLLI
2008
145views more  JOLLI 2008»
15 years 2 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack