2845 search results - page 215 / 569 » Constraints over Ontologies |
166
Voted
IJCAI
1993
15 years 8 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
181
click to vote
JAIR
2008
15 years 6 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
146
click to vote
JPDC
2006
15 years 6 months ago
2006
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
165
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
189
click to vote
CLIMA
2011
2011
Justice Delayed Is Justice Denied: Logics for a Temporal Account of Reparations and Legal Compliance
14 years 6 months ago
In this paper we extend the logic of violation proposed by [14] with time, more precisely, we temporalise that logic. The resulting system allows us to capture many subtleties of t...