Sciweavers

3110 search results - page 386 / 622
» On the initialization of the DNMF algorithm
Sort
View
3DIM
2005
IEEE
16 years 6 days ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
PDP
2005
IEEE
16 years 5 days ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
SACMAT
2005
ACM
16 years 4 days ago
Role mining with ORCA
With continuously growing numbers of applications, enterprises face the problem of efficiently managing the assignment of access permissions to their users. On the one hand, secur...
Jürgen Schlegelmilch, Ulrike Steffens
CP
2005
Springer
16 years 3 days ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
16 years 1 days ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich