Sciweavers

7280 search results - page 1131 / 1456
» Optimization Techniques
Sort
View
243
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 7 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
ETFA
2008
IEEE
16 years 2 months ago
Using neural networks for quality management
We present a method for fine grain QoS control of multimedia applications. This method takes as input an application software composed of actions. The execution times are unknown...
Mohamad Jaber, Jacques Combaz, Loïc Strus, Je...
251
Voted
DSN
2007
IEEE
16 years 1 months ago
Using Process-Level Redundancy to Exploit Multiple Cores for Transient Fault Tolerance
Transient faults are emerging as a critical concern in the reliability of general-purpose microprocessors. As architectural trends point towards multi-threaded multi-core designs,...
Alex Shye, Tipp Moseley, Vijay Janapa Reddi, Josep...
212
Voted
ECAI
2004
Springer
16 years 29 days ago
Towards Efficient Learning of Neural Network Ensembles from Arbitrarily Large Datasets
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
Kang Peng, Zoran Obradovic, Slobodan Vucetic
« Prev « First page 1131 / 1456 Last » Next »