Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ACCV
2010
Springer
11 years 3 months ago
A Phase Discrepancy Analysis of Object Motion
Abstract. Detecting moving objects against dynamic backgrounds remains a challenge in computer vision and robotics. This paper presents a surprisingly simple algorithm to detect ob...
Bolei Zhou, Xiaodi Hou, Liqing Zhang
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
11 years 6 months ago
A dipole field for object delivery by pushing on a flat surface
—This paper introduces a simple algorithm for non-prehensile object transportation by a pushing robot on a flat surface. We assume that the global position and orientation of the...
Takeo Igarashi, Yoichi Kamiyama, Masahiko Inami
CORR
2004
Springer
111views Education» more  CORR 2004»
11 years 8 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison
CORR
2004
Springer
83views Education» more  CORR 2004»
11 years 8 months ago
Generating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
Guy Melançon, Fabrice Philippe
CORR
2004
Springer
115views Education» more  CORR 2004»
11 years 8 months ago
An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
: In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non...
Florentin Smarandache, Jean Dezert
CAGD
2005
113views more  CAGD 2005»
11 years 8 months ago
Fast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
DAM
2007
74views more  DAM 2007»
11 years 8 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
CORR
2008
Springer
169views Education» more  CORR 2008»
11 years 8 months ago
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
Mingyu Xiao, Leizhen Cai, Andrew C. Yao
SODA
2000
ACM
148views Algorithms» more  SODA 2000»
11 years 9 months ago
Computing contour trees in all dimensions
We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...
Hamish Carr, Jack Snoeyink, Ulrike Axen
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
11 years 9 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
Anupam Gupta
books