Sciweavers

1258 search results - page 179 / 252
» Architecture-driven Problem Decomposition
Sort
View
TPHOL
1999
IEEE
14 years 1 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
PODC
2010
ACM
14 years 24 days ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 11 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
JAIR
2010
130views more  JAIR 2010»
13 years 7 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
CVPR
1996
IEEE
14 years 11 months ago
Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
Xiaoguang Wang, Yong-Qing Cheng, Robert T. Collins...