5275 search results - page 279 / 1055 » Computing by observing |
113
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
130
click to vote
WSCG
2001
15 years 5 months ago
2001
Imaged-based rendering is a well-known method in computer graphics to achieve photo-realistic images. In this paper we show how conventional image-based rendering algorithms can b...
102
click to vote
NIPS
2003
15 years 5 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
118
click to vote
COLING
1992
15 years 5 months ago
1992
: An approach to the computational treatment of style is presented in the case of generation of informative texts. We regard the style mestly as a me,as of controlled selection of ...
132
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...