Sciweavers

7988 search results - page 1062 / 1598
» A Useful Undecidable Theory
Sort
View
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
16 years 1 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
FM
2009
Springer
157views Formal Methods» more  FM 2009»
16 years 1 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
FMCAD
2009
Springer
16 years 1 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
ICMI
2009
Springer
147views Biometrics» more  ICMI 2009»
16 years 1 months ago
Multimodal end-of-turn prediction in multi-party meetings
One of many skills required to engage properly in a conversation is to know the appropiate use of the rules of engagement. In order to engage properly in a conversation, a virtual...
Iwan de Kok, Dirk Heylen
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
« Prev « First page 1062 / 1598 Last » Next »