Sciweavers

580 search results - page 113 / 116
» Studying the History of Ideas Using Topic Models
Sort
View
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
WWW
2011
ACM
14 years 4 months ago
Pragmatic evaluation of folksonomies
Recently, a number of algorithms have been proposed to obtain hierarchical structures — so-called folksonomies — from social tagging data. Work on these algorithms is in part ...
Denis Helic, Markus Strohmaier, Christoph Trattner...
CHI
2006
ACM
15 years 10 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
POPL
2010
ACM
15 years 7 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
COLT
1993
Springer
15 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...