Sciweavers

2632 search results - page 230 / 527
» Alternating Timed Automata
Sort
View
CORR
2010
Springer
39views Education» more  CORR 2010»
15 years 4 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty
CHI
2011
ACM
14 years 10 months ago
Informing decisions: how people use online rating information to make choices
In this paper we investigate how people use online rating information to inform decision making. We examine whether a theory of searching for information to discriminate between a...
Stelios Lelis, Andrew Howes
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
CIKM
2009
Springer
16 years 1 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...
ECOOP
2004
Springer
16 years 1 days ago
Transactional Monitors for Concurrent Objects
Transactional monitors are proposed as an alternative to monitors based on mutualexclusion synchronization for object-oriented programming languages. Transactional monitors have e...
Adam Welc, Suresh Jagannathan, Antony L. Hosking