Sciweavers

117 search results - page 23 / 24
» Run-Time Bytecode Specialization
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 11 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 11 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 10 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
JUCS
2008
162views more  JUCS 2008»
13 years 9 months ago
Composition and Run-time Adaptation of Mismatching Behavioural Interfaces
Abstract: Reuse of software entities such as components or Web services raise composition issues since, most of the time, they present mismatches in their interfaces. These mismatc...
Javier Cámara, Gwen Salaün, Carlos Can...