Sciweavers

2342 search results - page 370 / 469
» Sublinear geometric algorithms
Sort
View
119
Voted
ICML
2007
IEEE
16 years 1 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 1 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 7 months ago
Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...
Hisao Ishibuchi, Yusuke Nojima, Noritaka Tsukamoto...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 6 months ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
128
Voted
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 5 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...