6047 search results - page 380 / 1210 » Modeling with Extend |
134
Voted
JSYML
2010
14 years 12 months ago
2010
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
134
Voted
FOSSACS
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
149
Voted
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We present a unified occlusion model for object instance detection under arbitrary viewpoint. Whereas previous approaches primarily modeled local coherency of occlusions or attem...
136
Voted
ISMVL
2010
IEEE
15 years 10 months ago
2010
IEEE
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
144
click to vote
ICIAP
2007
ACM
16 years 5 months ago
2007
ACM
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(...