Sciweavers

2623 search results - page 368 / 525
» Universal Learning Theory
Sort
View
CHI
2009
ACM
16 years 7 months ago
Programming reality: from transitive materials to organic user interfaces
Over the past few years, a quiet revolution has been redefining our fundamental computing technologies. Flexible E-Ink, OLED displays, shape-changing materials, parametric design,...
Marcelo Coelho, Ivan Poupyrev, Sajid Sadi, Roel Ve...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 6 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
STOC
2003
ACM
117views Algorithms» more  STOC 2003»
16 years 6 months ago
Distinct distances in three and higher dimensions
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
Boris Aronov, János Pach, Micha Sharir, G&a...
CIKM
2009
Springer
16 years 1 months ago
Using multiple ontologies in information extraction
Ontology-Based Information Extraction (OBIE) has recently emerged as a subfield of Information Extraction (IE). Here, ontologies - which provide formal and explicit specificatio...
Daya C. Wimalasuriya, Dejing Dou
CONCUR
2009
Springer
16 years 1 months ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...