Sciweavers

272 search results - page 50 / 55
» Programming languages capturing complexity classes
Sort
View
POPL
2009
ACM
14 years 8 months ago
The semantics of progress in lock-based transactional memory
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
Rachid Guerraoui, Michal Kapalka
BIOINFORMATICS
2005
96views more  BIOINFORMATICS 2005»
13 years 7 months ago
BioLingua: a programmable knowledge environment for biologists
BioLingua is an interactive, web-based programming environment that enables biologists to analyze biological systems by combining knowledge and data through direct end-user progra...
J. P. Massar, Michael Travers, Jeff Elhai, Jeff Sh...
ALT
1995
Springer
13 years 11 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ICALP
2004
Springer
14 years 23 days ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 months ago
Forward Decay: A Practical Time Decay Model for Streaming Systems
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...
Graham Cormode, Vladislav Shkapenyuk, Divesh Sriva...