Sciweavers

2877 search results - page 335 / 576
» The Complexity of Planarity Testing
Sort
View
190
Voted
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
PROMS
2001
Springer
109views Multimedia» more  PROMS 2001»
15 years 11 months ago
Model-Based Service Creation in the Friends Project
—This paper presents a model-based approach to service creation. We observe that the complexity of software services increases. To manage this complexity, and to quickly create s...
Wouter B. Teeuw, Dick A. C. Quartel
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
15 years 11 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
DOLAP
1999
ACM
15 years 11 months ago
starER: A Conceptual Model for Data Warehouse Design
Modeling data warehouses is a complex task focusing, very often, into internal structures and implementation issues. In this paper we argue that, in order to accurately reflect the...
Nectaria Tryfona, Frank Busborg, Jens G. Borch Chr...
ICCAD
1998
IEEE
76views Hardware» more  ICCAD 1998»
15 years 11 months ago
Functional debugging of systems-on-chip
Due to the exponential growth of both design complexity and the number of gates per pin, functional debugging has emerged as a critical step in the development of a system-on-chip...
Darko Kirovski, Miodrag Potkonjak, Lisa M. Guerra