Sciweavers

511 search results - page 68 / 103
» The intrinsic dimensionality of graphs
Sort
View
ICRA
2005
IEEE
113views Robotics» more  ICRA 2005»
14 years 3 months ago
A Sample-based Convex Cover for Rapidly Finding an Object in a 3-D Environment
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
14 years 3 hour ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 10 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
DCG
2011
13 years 5 months ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
ICSE
2008
IEEE-ACM
14 years 10 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer