Sciweavers

2652 search results - page 230 / 531
» Privacy-preserving linear programming
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
Optimizing Inter-Nest Data Locality Using Loop Splitting and Reordering
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
Sofiane Naci
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 9 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
WCRE
2002
IEEE
15 years 8 months ago
Exposing Data-Level Parallelism in Sequential Image Processing Algorithms
As new computer architectures are developed to exploit large-scale data-level parallelism, techniques are needed to retarget legacy sequential code to these platforms. Sequential ...
Lewis B. Baumstark Jr., Linda M. Wills
CP
2008
Springer
15 years 5 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
MP
2006
119views more  MP 2006»
15 years 3 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey