Sciweavers

1941 search results - page 215 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ICALP
2007
Springer
16 years 18 days ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 18 days ago
Manipulation in Games
This paper studies to which extent the social welfare of a game can be influenced by an interested third party within economic reason, i.e., by taking the implementation cost into...
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schm...
IPPS
2006
IEEE
16 years 14 days ago
Neighbourhood maps: decentralised ranking in small-world P2P networks
Reputation in P2P networks is an important tool to encourage cooperation among peers. It is based on ranking of peers according to their past behaviour. In large-scale real world ...
Matteo Dell'Amico
QEST
2006
IEEE
16 years 14 days ago
Measuring and Modeling of Application Flow Length in Commercial GPRS Networks
New mobile access networks provide reasonable high bandwidth to allow true internet access. This paper models two dominant applications of those networks. One application, WAP, is...
Roger Kalden, Boudewijn R. Haverkort
CVPR
2005
IEEE
16 years 2 days ago
Symmetric Stereo Matching for Occlusion Handling
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
Jian Sun, Yin Li, Sing Bing Kang