Sciweavers

2825 search results - page 197 / 565
» Robust Feature Selection Algorithms
Sort
View
102
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 8 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
SIGMETRICS
2010
ACM
178views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
Optimality, fairness, and robustness in speed scaling designs
System design must strike a balance between energy and performance by carefully selecting the speed at which the system will run. In this work, we examine fundamental tradeoffs i...
Lachlan L. H. Andrew, Minghong Lin, Adam Wierman
SI3D
2003
ACM
15 years 7 months ago
Interactive image-based rendering using feature globalization
Image-based rendering (IBR) systems enable virtual walkthroughs of photorealistic environments by warping and combining reference images to novel viewpoints under interactive user...
Daniel G. Aliaga, Dimah Yanovsky, Thomas A. Funkho...
87
Voted
ICPR
2008
IEEE
15 years 9 months ago
Adaptive selection of non-target cluster centers for K-means tracker
Hua et al. have proposed a stable and efficient tracking algorithm called “K-means tracker”[2, 3, 5]. This paper describes an adaptive non-target cluster center selection met...
Hiroshi Oike, Haiyuan Wu, Toshikazu Wada
DKE
2002
107views more  DKE 2002»
15 years 2 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias