Sciweavers

738 search results - page 99 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
DAC
2002
ACM
15 years 10 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...
MOBIHOC
2008
ACM
15 years 9 months ago
Delay-bounded routing in vehicular ad-hoc networks
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
Antonios Skordylis, Niki Trigoni
ICALP
2004
Springer
15 years 3 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson
IJCV
2007
138views more  IJCV 2007»
14 years 9 months ago
Correspondence-free Structure from Motion
We present a novel approach for the estimation of 3D-motion directly from two images using the Radon transform. The feasibility of any camera motion is computed by integrating over...
Ameesh Makadia, Christopher Geyer, Kostas Daniilid...
CVPR
2011
IEEE
14 years 1 months ago
Supervised Hypergraph Labeling
We address the problem of labeling individual datapoints given some knowledge about (small) subsets or groups of them. The knowledge we have for a group is the likelihood value fo...
Toufiq Parag, Ahmed Elgammal