Sciweavers

780 search results - page 101 / 156
» Compositional Quantitative Reasoning
Sort
View
92
Voted
GIS
1995
ACM
15 years 4 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
94
Voted
FOIS
2006
15 years 2 months ago
A theory of granular parthood based on qualitative cardinality and size measures
We present a theory of granular parthood based on qualitative cardinality and size measures. Using standard mereological relations and qualitative, contextdependent relations such ...
Thomas Bittner, Maureen Donnelly
96
Voted
CSL
2010
Springer
15 years 1 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
CSL
2007
Springer
15 years 19 days ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young
95
Voted
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 18 days ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer