Sciweavers

924 search results - page 133 / 185
» A Probabilistic Approach to Language Change
Sort
View
ICALP
2009
Springer
16 years 4 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ATAL
2009
Springer
15 years 11 months ago
Increasing the expressiveness of virtual agents: autonomous generation of speech and gesture for spatial description tasks
Embodied conversational agents are required to be able to express themselves convincingly and autonomously. Based on an empirial study on spatial descriptions of landmarks in dire...
Kirsten Bergmann, Stefan Kopp
IPM
2007
105views more  IPM 2007»
15 years 4 months ago
Parsimonious translation models for information retrieval
In the KL divergence framework, the extended language modeling approach has a critical problem estimating a query model, which is the probabilistic model that encodes user’s inf...
Seung-Hoon Na, In-Su Kang, Jong-Hyeok Lee
CC
2010
Springer
190views System Software» more  CC 2010»
15 years 11 months ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...
141
Voted
VLDB
2005
ACM
165views Database» more  VLDB 2005»
15 years 10 months ago
Semantic Adaptation of Schema Mappings when Schemas Evolve
Schemas evolve over time to accommodate the changes in the information they represent. Such evolution causes invalidation of various artifacts depending on the schemas, such as sc...
Cong Yu, Lucian Popa