Sciweavers

774 search results - page 23 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
DAC
2005
ACM
14 years 9 months ago
ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction
This paper presents an efficient hierarchical 3D capacitance extraction algorithm -- ICCAP. Most previous capacitance extraction algorithms introduce intermediate variables to fac...
Rong Jiang, Yi-Hao Chang, Charlie Chung-Ping Chen
STACS
2004
Springer
14 years 2 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
COMCOM
1998
106views more  COMCOM 1998»
13 years 8 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
ICRA
2008
IEEE
123views Robotics» more  ICRA 2008»
14 years 3 months ago
Exact state and covariance sub-matrix recovery for submap based sparse EIF SLAM algorithm
— This paper provides a novel state vector and covariance sub-matrix recovery algorithm for a recently developed submap based exactly sparse Extended Information Filter (EIF) SLA...
Shoudong Huang, Zhan Wang, Gamini Dissanayake
PCI
2005
Springer
14 years 2 months ago
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
Stavros D. Nikolopoulos, Leonidas Palios