Sciweavers

5326 search results - page 274 / 1066
» On what we can ensure
Sort
View
ENTCS
2006
169views more  ENTCS 2006»
15 years 6 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
VLDB
2002
ACM
144views Database» more  VLDB 2002»
15 years 6 months ago
Shooting Stars in the Sky: An Online Algorithm for Skyline Queries
Skyline queries ask for a set of interesting points from a potentially large set of data points. If we are traveling, for instance, a restaurant might be interesting if there is n...
Donald Kossmann, Frank Ramsak, Steffen Rost
ECIR
2009
Springer
15 years 4 months ago
Studying Query Expansion Effectiveness
Query expansion is an effective technique in improving the retrieval performance for ad-hoc retrieval. However, query expansion can also fail, leading to a degradation of the retri...
Ben He, Iadh Ounis
APLAS
2011
ACM
14 years 6 months ago
Decentralized Delimited Release
Abstract. Decentralization is a major challenge for secure computing. In a decentralized setting, principals are free to distrust each other. The key challenge is to provide suppor...
Jonas Magazinius, Aslan Askarov, Andrei Sabelfeld
INFOCOM
2002
IEEE
15 years 11 months ago
Beyond Routing: An Algebraic Approach to Network Coding
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...
Muriel Médard, Ralf Koetter