3937 search results - page 401 / 788 » Questioning Ubiquitous Computing |
184
Voted
NIPS
2004
15 years 7 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
147
click to vote
COLING
1994
15 years 7 months ago
1994
This paper presents the results of an experiment usiug machine-readable dictionaries (Mill)s) and corpora for building concatenativc units for text to speech (T'PS) systems. ...
186
click to vote
ACL
1990
15 years 7 months ago
1990
In this paper, we present a computational method for transforming a syntactic graph, which represents all syntactic interpretations of a sentence, into a semantic graph which filt...
134
Voted
TCBB
2008
15 years 6 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
158
click to vote
IPL
2007
15 years 6 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...