Sciweavers

725 search results - page 63 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
SIGCOMM
2005
ACM
15 years 3 months ago
OpenDHT: a public DHT service and its uses
Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a pub...
Sean C. Rhea, Brighten Godfrey, Brad Karp, John Ku...
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
15 years 6 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...
ECCV
2008
Springer
15 years 11 months ago
Online Sparse Matrix Gaussian Process Regression and Vision Applications
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
Ananth Ranganathan, Ming-Hsuan Yang
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 3 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 4 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...