Sciweavers

5214 search results - page 819 / 1043
» The Online Specialization Problem
Sort
View
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 10 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
174
Voted
VLDB
1992
ACM
116views Database» more  VLDB 1992»
15 years 10 months ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
ICLP
1990
Springer
15 years 10 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
DAC
1998
ACM
15 years 10 months ago
Efficient Boolean Division and Substitution
Boolean division, and hence Boolean substitution, produces better result than algebraic division and substitution. However, due to the lack of an efficient Boolean division algorit...
Shih-Chieh Chang, David Ihsin Cheng
188
Voted
CIT
2007
Springer
15 years 10 months ago
An Aspect Enhanced Method of NFR Modeling in Software Architecture
Existence of crosscutting concerns in software requirements often intensifies complexity of software development. Modeling and analysis of these concerns at software architecture ...
Hamid Bagheri, Seyed-Hassan Mirian-Hosseinabadi, H...