Sciweavers

5084 search results - page 137 / 1017
» Proving Possibility Properties
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 5 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
ICFP
2005
ACM
16 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
16 years 3 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
3DPVT
2006
IEEE
190views Visualization» more  3DPVT 2006»
15 years 11 months ago
3D City Modeling Using Cognitive Loops
3D city modeling using computer vision is very challenging. A typical city contains objects which are a nightmare for some vision algorithms, while other algorithms have been desi...
Nico Cornelis, Bastian Leibe, Kurt Cornelis, Luc J...
ICFEM
2005
Springer
15 years 11 months ago
An Evidential Tool Bus
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
John M. Rushby