Sciweavers

829 search results - page 153 / 166
» Distance domination-critical graphs
Sort
View
VC
2008
94views more  VC 2008»
14 years 9 months ago
Virtual world explorations by using topological and semantic knowledge
This paper is dedicated to virtual world exploration techniques. Automatic camera control is important in many fields as computational geometry, visual servoing, robot motion, grap...
Dmitry Sokolov, Dimitri Plemenos
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 8 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...
KBSE
2010
IEEE
14 years 8 months ago
Test generation to expose changes in evolving programs
Software constantly undergoes changes throughout its life cycle, and thereby it evolves. As changes are introduced into a code base, we need to make sure that the effect of the ch...
Dawei Qi, Abhik Roychoudhury, Zhenkai Liang
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
13 years 9 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
15 years 1 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls