Sciweavers

1115 search results - page 32 / 223
» Separating Shape Graphs
Sort
View
108
Voted
POPL
1997
ACM
15 years 3 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer
78
Voted
MP
2010
99views more  MP 2010»
14 years 9 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
82
Voted
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
14 years 10 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 3 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
119
Voted
CVPR
2012
IEEE
13 years 1 months ago
Multi view registration for novelty/background separation
We propose a system for the automatic segmentation of novelties from the background in scenarios where multiple images of the same environment are available e.g. obtained by weara...
Omid Aghazadeh, Josephine Sullivan, Stefan Carlsso...