306 search results - page 3 / 62 » Underspecified computation of normal forms |
ACSC
2007
IEEE
14 years 1 months ago
2007
IEEE
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
COLT
2003
Springer
14 years 22 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
TCS
2011
13 years 2 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
VLDB
1990
ACM
13 years 11 months ago
1990
ACM
Relations in partitioned normal form are an important subclass of nested relations. This paper is concerned with the problem of restructuring relations in partitioned normal form ...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...