Sciweavers

611 search results - page 49 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
HASKELL
2009
ACM
14 years 2 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
3DOR
2010
13 years 3 months ago
Learning the Compositional Structure of Man-Made Objects for 3D Shape Retrieval
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...
Raoul Wessel, Reinhard Klein
APWEB
2005
Springer
14 years 1 months ago
An Updates Dissemination Protocol for Read-Only Transaction Processing in Mobile Real-Time Computing Environments
Data management issues in mobile computing environments have got lots of concerns of relevant researchers. Among these research topics, data broadcast has been extensively investig...
Guohui Li, Hongya Wang, Jixiong Chen, Yingyuan Xia...
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 9 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
TLCA
2009
Springer
14 years 2 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann