Sciweavers

874 search results - page 88 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
FOCS
2010
IEEE
14 years 11 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
94
Voted
COMPUTER
2006
98views more  COMPUTER 2006»
15 years 1 months ago
Componentization: The Visitor Example
: In software design, laziness is a virtue: it's better to reuse than to redo. Design patterns are a good illustration. Patterns, a major advance in software architecture, pro...
Bertrand Meyer, Karine Arnout
125
Voted
APSEC
1996
IEEE
15 years 5 months ago
M-base : An Application Development Environment for End-user Computing based on Message Flow
Explosive increase in end-user computing on distributed systems requires that end-users develop application software by themselves. One solution is given as aformula of "adom...
Takeshi Chusho, Yuji Konishi, Masao Yoshioka
145
Voted
ISPAN
2002
IEEE
15 years 6 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
108
Voted
IPPS
2000
IEEE
15 years 5 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...