Sciweavers

2069 search results - page 312 / 414
» Linear time algorithms for Clobber
Sort
View
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
16 years 27 days ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 6 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 8 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
RSS
2007
128views Robotics» more  RSS 2007»
15 years 7 months ago
Data Association in O(n) for Divide and Conquer SLAM
—In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divid...
Lina María Paz, José E. Guivant, Jua...
GD
2008
Springer
15 years 7 months ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader