Sciweavers

3744 search results - page 307 / 749
» Shape from Symmetry
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Deep transfer via second-order Markov logic
Standard inductive learning requires that training and test instances come from the same distribution. Transfer learning seeks to remove this restriction. In shallow transfer, tes...
Jesse Davis, Pedro Domingos
AMAST
1991
Springer
15 years 10 months ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
QI
2009
Springer
117views Physics» more  QI 2009»
16 years 1 months ago
Generalising Unitary Time Evolution
In this third Quantum Interaction (QI) meeting it is time to examine our failures. One of the weakest elements of QI as a field, arises in its continuing lack of models displaying...
Kirsty Kitto, Peter Bruza, Laurianne Sitbon
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
16 years 12 days ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 6 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch