Sciweavers

6618 search results - page 1045 / 1324
» Natural Logic for Natural Language
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 4 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
TARK
2007
Springer
16 years 27 days ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh
CHI
2006
ACM
16 years 23 days ago
Perspective cursor: perspective-based interaction for multi-display environments
Multi-display environments and smart meeting rooms are now becoming more common. These environments build a shared display space from variety of devices: tablets, projected surfac...
Miguel A. Nacenta, Samer Sallam, Bernard Champoux,...
180
Voted
GI
2009
Springer
15 years 11 months ago
Flow-driven Interactions for Adaptive Pervasive Applications
: The era of ubiquitous and pervasive computing technology opens the world for new pervasive applications and services within the physical surroundings. Often users find themselves...
Bashar Altakrouri
CCA
2009
Springer
15 years 10 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
« Prev « First page 1045 / 1324 Last » Next »