Sciweavers

614 search results - page 63 / 123
» DE in Slovenia: Where are We
Sort
View
FSTTCS
2004
Springer
14 years 2 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
ISESE
2003
IEEE
14 years 2 months ago
Management of Interdependencies in Collaborative Software Development
In this paper we report results of an informal field study of a software development team conducted during an eight week internship at the NASA/Ames Research Center. The team deve...
Cleidson R. B. de Souza, David F. Redmiles, Gloria...
SMI
2003
IEEE
111views Image Analysis» more  SMI 2003»
14 years 2 months ago
Isotropic Surface Remeshing
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function d...
Pierre Alliez, Éric Colin de Verdièr...
ICALP
2010
Springer
14 years 1 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...
IPPS
2000
IEEE
14 years 1 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen