Sciweavers

1225 search results - page 101 / 245
» The Instance Complexity Conjecture
Sort
View
ENDM
2007
68views more  ENDM 2007»
13 years 9 months ago
Detecting induced subgraphs
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
Benjamin Lévêque, David Y. Lin, Fr&ea...
JC
2007
101views more  JC 2007»
13 years 9 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
COMCOM
2004
96views more  COMCOM 2004»
13 years 9 months ago
Achieving proportional delay differentiation efficiently
In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model (PDM) first proposed under the Dif...
Hoon-Tong Ngin, Chen-Khong Tham
COMSIS
2010
13 years 6 months ago
Generative 3D images in a visual evolutionary computing system
This paper presents a novel computer-aided design system which uses a computational approach to producing 3D images for stimulating creativity of designers. It introduces the genet...
Hong Liu
CVPR
2011
IEEE
13 years 4 months ago
FlowBoost - Appearance Learning from Sparsely Annotated Video
We propose a new learning method which exploits temporal consistency to successfully learn a complex appearance model from a sparsely labeled training video. Our approach consists...
Karim Ali, Francois Fleuret, David Hasler