Sciweavers

1724 search results - page 140 / 345
» Models for Concurrency
Sort
View
OOPSLA
2005
Springer
15 years 8 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
SOFSEM
2007
Springer
15 years 9 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
151
Voted
TIME
2009
IEEE
15 years 10 months ago
Preserving Anonymity of Recurrent Location-Based Queries
—The anonymization of location based queries through the generalization of spatio-temporal information has been proposed as a privacy preserving technique. We show that the prese...
Daniele Riboni, Linda Pareschi, Claudio Bettini, S...
126
Voted
ACCV
2009
Springer
15 years 10 months ago
Human Action Recognition Using HDP by Integrating Motion and Location Information
The method based on local features has an advantage that the important local motion feature is represented as bag-of-features, but lacks the location information. Additionally, in ...
Yasuo Ariki, Takuya Tonaru, Tetsuya Takiguchi
123
Voted
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 years 10 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir