Sciweavers

458 search results - page 28 / 92
» Distance graphs: from random geometric graphs to Bernoulli g...
Sort
View
STACS
2010
Springer
14 years 3 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
A Unique "Nonnegative" Solution to an Underdetermined System: from Vectors to Matrices
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
Meng Wang, Weiyu Xu, Ao Tang
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
14 years 2 months ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 3 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
AI
2008
Springer
13 years 8 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson