Sciweavers

9842 search results - page 1862 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CAISE
1999
Springer
14 years 2 months ago
Designing the Global Data Warehouse with SPJ Views
Abstract. A global Data warehouse (DW) integrates data from multiple distributed heterogeneous databases and other information sources. DW can be abstractly seen as a set of materi...
Dimitri Theodoratos, Spyros Ligoudistianos, Timos ...
IPPS
1999
IEEE
14 years 2 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
14 years 2 months ago
Multi-objective design strategy for high-level low power design of DSP systems
High-level power design presents a complex, multiobjective problem that involves the simultaneous optimisation of competing criteria such as speed, area and power. It is difficult...
Mark S. Bright, Tughrul Arslan
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
14 years 2 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
COLT
1999
Springer
14 years 2 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...
« Prev « First page 1862 / 1969 Last » Next »