Sciweavers

685 search results - page 96 / 137
» Performance of Runtime Optimization on BLAST
Sort
View
CP
2010
Springer
13 years 7 months ago
Checking-Up on Branch-and-Check
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...
J. Christopher Beck
COMPSAC
2011
IEEE
12 years 8 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...
LCTRTS
2009
Springer
14 years 3 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
MSWIM
2004
ACM
14 years 2 months ago
Scalable simulation of large-scale wireless networks with bounded inaccuracies
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such ...
Zhengrong Ji, Junlan Zhou, Mineo Takai, Rajive Bag...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 1 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last