Sciweavers

372 search results - page 69 / 75
» On the Structural Complexity of Natural Language Sentences
Sort
View
NIPS
2007
13 years 8 months ago
Learning and using relational theories
Much of human knowledge is organized into sophisticated systems that are often called intuitive theories. We propose that intuitive theories are mentally represented in a logical ...
Charles Kemp, Noah Goodman, Joshua B. Tenenbaum
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
UML
2005
Springer
14 years 25 days ago
Workshop Report: Model Driven Development of Advanced User Interfaces (MDDAUI)
Abstract. This paper reports about the workshop Model Driven Development of Advanced User Interfaces (MDDAUI) which was held on October 2nd, 2005 at the MoDELS/UML 2005 conference ...
Andreas Pleuß, Jan Van den Bergh, Stefan Sau...
HOPL
2007
13 years 11 months ago
AppleScript
AppleScript is a scripting language and environment for the Mac OS. Originally conceived in 1989, AppleScript allows end-users to automate complex tasks and customize Mac OS appli...
William R. Cook
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 7 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky