An effective method in practice to compute quality Delaunay triangulations is to apply parallel refinements that insert Steiner points whose prestars in the triangulation do not overlap. We show that these algorithms ...
详细信息
ISBN:
(纸本)9781581138405
An effective method in practice to compute quality Delaunay triangulations is to apply parallel refinements that insert Steiner points whose prestars in the triangulation do not overlap. We show that these algorithms can be implemented in O(log m) time using m processors, where m is the output size. To our knowledge, this is the first such analysis.
A program to automate the finite element method (FEM) using various soft-computing techniques is presented. The overall program is discussed, and the implementations of three specific sub-problems (mesh placement, nod...
详细信息
Using deformed products of arrangements, we construct a family of linear programs with n inequalities in R-fraktur signd on which, in the worst-case, the least-index criss-cross method requires Ω(nd) (for fixed d) pi...
详细信息
Using deformed products of arrangements, we construct a family of linear programs with n inequalities in R-fraktur signd on which, in the worst-case, the least-index criss-cross method requires Ω(nd) (for fixed d) pivots to reach optmiality.
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that consider heterogeneity of nodes inside the c...
详细信息
Currently, the Web became a very enormous resource of data, often hidden in documents. Most of the Web applications represent the data under a structured format, in particularly tables and lists. These data are automa...
详细信息
In this paper we present an algorithm that estimates dense planar-parallax motion from multiple uncalibrated views of a 3D scene. This generalizes the "plane + parallax" recovery methods to more than two fra...
详细信息
In a secure group communication system, messages must be encrypted before being transmitted to group members to prevent unauthorized access. In many secure group communication schemes, whenever a member leaves or join...
详细信息
In a secure group communication system, messages must be encrypted before being transmitted to group members to prevent unauthorized access. In many secure group communication schemes, whenever a member leaves or joins the group, group center (GC) immediately changes the common encryption key and sends the new key to all valid members for forward and backward secrecy. If valid members are not on-line, they will miss the re-keying messages and will not be able to decrypt any ciphertext. Therefore, group members must be able to store the state of the system. In some applications, like global positioning systems (GPS) or pay-per-view systems, it is not reasonable to ask group members to stay on-line all the time and save the changes to the system. A hierarchical binary tree-based key management scheme are proposed for a secure group communication. This scheme reduces the key storage requirement of GC to a constant size and the group members are not required to be on-line constantly (stateless).
The purpose of this work is to provide access to meteorological data as well as information of the status of air quality for the city of Kozani in real time with a userfriendly interface. The application has been deve...
详细信息
作者：
Spijker, M.N.Univ of Leiden
Inst of Applied Mathematics & Computer Science Leiden Neth Univ of Leiden Inst of Applied Mathematics & Computer Science Leiden Neth
This paper concerns the rate of growth of numerical approximations obtained by one-step methods for solving linear stiff initial value problems. For some of these methods weak stability with respect to arbitrary norms...
详细信息
This paper concerns the rate of growth of numerical approximations obtained by one-step methods for solving linear stiff initial value problems. For some of these methods weak stability with respect to arbitrary norms is shown to be equivalent to contractivity. This kind of stability is also proved to entail a barrier p less than equivalent to 1 for the order of accuracy p within a broad class of methods, including general Runge-Kutta methods with m greater than equivalent to 1 stages.
暂无评论