Sciweavers

2938 search results - page 46 / 588
» On obfuscating point functions
Sort
View
DAM
2008
123views more  DAM 2008»
13 years 7 months ago
Ultrametrics, Banach's fixed point theorem and the Riordan group
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
Ana Luzón, Manuel A. Morón
ICTAI
2008
IEEE
14 years 2 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
VLDB
2004
ACM
103views Database» more  VLDB 2004»
14 years 1 months ago
Maintenance of Spatial Semijoin Queries on Moving Points
In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to t...
Glenn S. Iwerks, Hanan Samet, Kenneth P. Smith
ICSM
1996
IEEE
13 years 12 months ago
Preprocessors from an Abstract Point of View
It is well known that the extensive use of preprocessors can lead to serious maintenance problems. However, these tools are still heavily used by developers and maintainers to imp...
Jean-Marie Favre
CCCG
2010
13 years 9 months ago
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
Zahed Rahmati, Alireza Zarei