Results 1  10
of
269,474
Designing Wavelets with Nice Properties
"... h 2k+1 = 1= p 2 (c) X k g k = 0 (d) X k g k g k+2j = ffi 0j for all j 2 Z (e) X k h k g k+2j = 0 for all j 2 Z (f) The only really essential ones are (a) and (b). They imply (c) (we will prove that shortly), and the rest are automatically satisfied for a suitable choice of fg k g (whi ..."
Abstract
 Add to MetaCart
h 2k+1 = 1= p 2 (c) X k g k = 0 (d) X k g k g k+2j = ffi 0j for all j 2 Z (e) X k h k g k+2j = 0 for all j 2 Z (f) The only really essential ones are (a) and (b). They imply (c) (we will prove that shortly), and the rest are automatically satisfied for a suitable choice of fg k g (which we will also spell out shortly). Condition (a) must be satisfied to make the recursion relation work. Condition (b) says that the integer translates of OE should be orthonormal. 7.1.2. In terms of H(). Recall that H
MATHEMATIQUES Analyse fonctionnelle ON PRIMAL LOWERNICE PROPERTY
, 2001
"... 8] Poliquin dened the class of primal lowernice functions in nite dimensional spaces. He shows that these functions are completely characterized by their Clarke subdierential. This is the rst large class of nonconvex lower ..."
Abstract
 Add to MetaCart
8] Poliquin dened the class of primal lowernice functions in nite dimensional spaces. He shows that these functions are completely characterized by their Clarke subdierential. This is the rst large class of nonconvex lower
Establishing Pairwise Keys in Distributed Sensor Networks
, 2003
"... Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensors, it is infeasible to use traditional key management techniques such as ..."
Abstract

Cited by 530 (29 self)
 Add to MetaCart
then presents two efficient instantiations of the general framework: a random subset assignment key predistribution scheme and a gridbased key predistribution scheme. The analysis in this paper indicates that these two schemes have a number of nice properties, including high probability (or guarantee
A Pairwise Key PreDistribution Scheme for Wireless Sensor Networks
, 2003
"... this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network resili ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller
ON THE CONNECTION BETWEEN A SYMMETRY CONDmON AND SEVERAL NICE PROPERTIES OF THE SPACES S9(A) AND T9(A)
, 1987
"... Abstract. In this paper it is proved that seveml topological properties of the spaces S 9(A) and T 9(A) are equivalent with a symmetry condition on the directed set 4». O. ..."
Abstract
 Add to MetaCart
Abstract. In this paper it is proved that seveml topological properties of the spaces S 9(A) and T 9(A) are equivalent with a symmetry condition on the directed set 4». O.
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
 IN PROC. KR2004
, 2004
"... Abstract. We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a wellbalanced interface between disjunctive logic programs and description logics, which guarantees the decidability of th ..."
Abstract

Cited by 280 (58 self)
 Add to MetaCart
of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic properties. In particular, it faithfully extends both disjunctive programs and description logics. Furthermore, we describe algorithms for reasoning in the new formalism, and we give a precise
TCP Nice: A Mechanism for Background Transfers
, 2002
"... background transfers transfers of data that humans are not waiting for to improve availability, reliability, latency or consistency. However, given the rapid fluctuations of available network bandwidth and changing resource costs due to technology trends, hand tuning the aggressiveness of background ..."
Abstract

Cited by 118 (12 self)
 Add to MetaCart
of near zerocost background transfers. Our system, TCP Nice, can provably bound the interference inflicted by background flows on foreground flows in a restricted network model. And our microbenchmarks and case study applications suggest that in practice it interferes little with foreground flows, reaps
Real time compression of triangle mesh connectivity
 SIGGRAPH 98 Conference Proceedings, Annual Conference Series
, 1998
"... In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known gl ..."
Abstract

Cited by 196 (11 self)
 Add to MetaCart
global compression algorithm. These nice properties have great benefits for several important applications. Naturally, the technique can be used to compress triangle meshes without significant delay before they are stored on external devices or transmitted over a network. The presented decompression
Results 1  10
of
269,474