Sciweavers

4325 search results - page 707 / 865
» Incremental computation with names
Sort
View
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 3 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
CCS
2006
ACM
15 years 3 months ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
CIARP
2006
Springer
15 years 3 months ago
Feature Selection Based on Mutual Correlation
Feature selection is a critical procedure in many pattern recognition applications. There are two distinct mechanisms for feature selection namely the wrapper methods and the filte...
Michal Haindl, Petr Somol, Dimitrios Ververidis, C...
EEE
2004
IEEE
15 years 3 months ago
e-Transformation Technologies: Case Studies and the Road Ahead - A Value Chain Perspective
e-Transformation technologies, for the past few years, have been evolving towards the goal of information integration and system interoperability. While there is no doubt that int...
William Kwok-Wai Cheung
FPL
2004
Springer
100views Hardware» more  FPL 2004»
15 years 3 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...