Sciweavers

742 search results - page 76 / 149
» Argumentative alternating offers
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 1 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
86
Voted
SIGSOFT
2008
ACM
16 years 18 days ago
Requirements engineering: from craft to discipline
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....
Axel van Lamsweerde
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 8 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
FOCS
2008
IEEE
15 years 6 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 6 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold