Sciweavers

584 search results - page 13 / 117
» Efficient mass decomposition
Sort
View
AMC
2005
195views more  AMC 2005»
13 years 8 months ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
CAD
2006
Springer
13 years 9 months ago
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang
ICPR
2006
IEEE
14 years 10 months ago
Line-Based Affine Invariant Object Location Using Transformation Space Decomposition
This paper presents a novel line-based affine invariant object location methodology. Our algorithm employs a new line-based transformation space decomposition technique to exploit...
Richard Yang, Yongsheng Gao
MASS
2010
173views Communications» more  MASS 2010»
13 years 6 months ago
Efficient routing in delay tolerant networks with correlated node mobility
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szyman...
MP
2002
84views more  MP 2002»
13 years 8 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...