Sciweavers

15073 search results - page 334 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
118
Voted
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
15 years 9 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan
AMC
2005
120views more  AMC 2005»
15 years 4 months ago
ICS: a package for computing involutive characteristic set of algebraic partial differential equation systems
A constructive algorithm for the completion of arbitrary algebraic partial differential equation systems to involutive ones are presented. Based on it, an implementation ICS for c...
Shan-Qing Zhang, Gui-Xu Zhang, Zhi-Bin Li
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 4 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
151
Voted
IPPS
1998
IEEE
15 years 9 months ago
Randomized Algorithms on the Mesh
The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the ...
Lata Narayanan
129
Voted
ICALP
2010
Springer
15 years 8 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis