Sciweavers

456 search results - page 42 / 92
» What is good
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
16 years 3 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
189
Voted
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 3 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
CCGRID
2007
IEEE
16 years 4 days ago
Build-and-Test Workloads for Grid Middleware: Problem, Analysis, and Applications
The Grid promise is starting to materialize today: largescale multi-site infrastructures have grown to assist the work of scientists from all around the world. This tremendous gro...
Alexandru Iosup, Dick H. J. Epema
MEMOCODE
2007
IEEE
16 years 2 days ago
Scheduling as Rule Composition
Bluespec is a high-level hardware description language used for architectural exploration, hardware modeling and synthesis of semiconductor chips. In Bluespec, one views hardware ...
Nirav Dave, Arvind, Michael Pellauer
WABI
2004
Springer
109views Bioinformatics» more  WABI 2004»
15 years 11 months ago
Online Consensus and Agreement of Phylogenetic Trees
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...
Tanya Y. Berger-Wolf