Sciweavers

6251 search results - page 437 / 1251
» Randomness, Computability, and Density
Sort
View
DCC
2001
IEEE
16 years 6 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
CVPR
2010
IEEE
16 years 3 months ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
IPPS
2006
IEEE
16 years 26 days ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
FOCS
2002
IEEE
15 years 11 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
ICPR
2010
IEEE
15 years 11 months ago
Fast and Spatially-Smooth Terrain Classification Using Monocular Camera
In this paper, we present a monocular camera based terrain classification scheme. The uniqueness of the proposed scheme is that it inherently incorporates spatial smoothness while...
Chetan Jakkoju, Madhava Krishna, C. V. Jawahar