Sciweavers

4039 search results - page 703 / 808
» A Method for Dynamic Clustering of Data
Sort
View
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
15 years 3 months ago
Biased Skip Lists
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goo...
TSMC
2008
198views more  TSMC 2008»
15 years 3 months ago
Representation Plurality and Fusion for 3-D Face Recognition
In this paper, we present an extensive study of 3-D face recognition algorithms and examine the benefits of various score-, rank-, and decision-level fusion rules. We investigate f...
Berk Gökberk, Helin Dutagaci, A. Ulas, Lale A...
ASC
2011
14 years 10 months ago
Evolutionary cepstral coefficients
Evolutionary algorithms provide flexibility and robustness required to find satisfactory solutions in complex search spaces. This is why they are successfully applied for solvin...
Leandro Daniel Vignolo, Hugo Leonardo Rufiner, Die...
CGF
2010
114views more  CGF 2010»
14 years 10 months ago
Transparent and Specular Object Reconstruction
This state of the art report covers reconstruction methods for transparent and specular objects or phenomena. While the 3D acquisition of opaque surfaces with lambertian reflectan...
Ivo Ihrke, Kiriakos N. Kutulakos, Hendrik P. A. Le...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 10 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner