Sciweavers

3598 search results - page 231 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
TKDE
1998
122views more  TKDE 1998»
15 years 6 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
APWEB
2010
Springer
15 years 10 months ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang
CCE
2005
15 years 6 months ago
Interactive evolutionary computation in process engineering
In practical system identification, process optimization and controller design, it is often desirable to simultaneously handle several objectives and constraints. In some cases, t...
János Madár, János Abonyi, Fe...
ICPR
2008
IEEE
16 years 1 months ago
Scale-invariant density-based clustering initialization algorithm and its application
In this paper, we bring out a new density-based clustering initialization algorithm which is invariant to the scale factor. Instead of using the scale factor while the cluster ini...
Chunsheng Hua, Ryusuke Sagawa, Yasushi Yagi
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 6 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis