Sciweavers

5595 search results - page 870 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
16 years 27 days ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
16 years 24 days ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
SMA
2006
ACM
120views Solid Modeling» more  SMA 2006»
16 years 17 days ago
Identifying flat and tubular regions of a shape by unstable manifolds
We present an algorithm to identify the flat and tubular regions of a three dimensional shape from its point sample. We consider the distance function to the input point cloud an...
Samrat Goswami, Tamal K. Dey, Chandrajit L. Bajaj
MOBIQUITOUS
2005
IEEE
16 years 6 days ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian
MFCS
2005
Springer
16 years 3 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher