Results 1  10
of
1,120,896
Quick inclusionexclusion
 ECMLPKDD Workshop on Knowledge Discovery in Inductive Databases
, 2005
"... Abstract. Many data mining algorithms make use of the wellknown InclusionExclusion principle. As a consequence, using this principle efficiently is crucial for the success of all these algorithms. Especially in the context of condensed representations, such as NDI, and in computing interesting mea ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
measures, a quick inclusionexclusion algorithm can be crucial for the performance. In this paper, we give an overview of several algorithms that depend on the inclusionexclusion principle and propose an efficient algorithm to use it and evaluate its complexity. The theoretically obtained results
INCLUSION–EXCLUSION BASED ALGORITHMS FOR
"... Abstract. We present a deterministic algorithm producing the number of kcolourings of a graph on n vertices in time 2nnO(1). We also show that the chromatic number can be found by a polynomial space algorithm running in time O(2.2461n). Finally, we present a family of polynomial space approximatio ..."
Abstract
 Add to MetaCart
Abstract. We present a deterministic algorithm producing the number of kcolourings of a graph on n vertices in time 2nnO(1). We also show that the chromatic number can be found by a polynomial space algorithm running in time O(2.2461n). Finally, we present a family of polynomial space approxi
InclusionExclusion Algorithms for . . .
, 2006
"... Given a set U with n elements and a family of subsets S ⊆ 2 U we show how to count the number of kpartitions S1 ∪···∪Sk = U into subsets Si ∈ S in time 2 n n O(1). The only assumption on S is that it can be enumerated in time 2 n n O(1). In effect we get exact algorithms in time 2 n n O(1) for seve ..."
Abstract
 Add to MetaCart
Given a set U with n elements and a family of subsets S ⊆ 2 U we show how to count the number of kpartitions S1 ∪···∪Sk = U into subsets Si ∈ S in time 2 n n O(1). The only assumption on S is that it can be enumerated in time 2 n n O(1). In effect we get exact algorithms in time 2 n n O(1
Set partitioning via inclusionexclusion
 SIAM J. Comput
"... Abstract. Given a set N with n elements and a family F of subsets, we show how to partition N into k such subsets in 2nnO(1) time. We also consider variations of this problem where the subsets may overlap or are weighted, and we solve the decision, counting, summation, and optimisation versions of t ..."
Abstract

Cited by 60 (7 self)
 Add to MetaCart
of these problems. Our algorithms are based on the principle of inclusion–exclusion and the zeta transform. In effect we get exact algorithms in 2nnO(1) time for several wellstudied partition problems including Domatic Number, Chromatic Number, Maximum kCut, Bin Packing, List Colouring, and the Chromatic
Routing Techniques in Wireless Sensor Networks: A Survey
 IEEE Wireless Communications
, 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract

Cited by 704 (2 self)
 Add to MetaCart
, however, has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we present a survey of the stateoftheart routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive
Approximate InclusionExclusion
 Combinatorica
, 1993
"... The InclusionExclusion formula expresses the size of a union of a family of sets in terms of the sizes of intersections of all subfamilies. This paper considers approximating the size of the union when intersection sizes are known for only some of the subfamilies, or when these quantities are giv ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
The InclusionExclusion formula expresses the size of a union of a family of sets in terms of the sizes of intersections of all subfamilies. This paper considers approximating the size of the union when intersection sizes are known for only some of the subfamilies, or when these quantities
InclusionExclusion Algorithms for Counting Set Partitions
, 2006
"... Given an nelement set U and a family of subsets S ⊆ 2 U we show how to count the number of kpartitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2 n n O(1). The only assumption on S is that it can be enumerated in time 2 n n O(1). In effect we get exact algorithms in time 2 n n O(1) fo ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
Given an nelement set U and a family of subsets S ⊆ 2 U we show how to count the number of kpartitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2 n n O(1). The only assumption on S is that it can be enumerated in time 2 n n O(1). In effect we get exact algorithms in time 2 n n O(1
A Survey of Medical Image Registration
, 1998
"... The purpose of this chapter is to present a survey of recent publications concerning medical image registration techniques. These publications will be classified according to a model based on nine salient criteria, the main dichotomy of which is extrinsic versus intrinsic methods The statistics of t ..."
Abstract

Cited by 540 (5 self)
 Add to MetaCart
The purpose of this chapter is to present a survey of recent publications concerning medical image registration techniques. These publications will be classified according to a model based on nine salient criteria, the main dichotomy of which is extrinsic versus intrinsic methods The statistics
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
be computed quickly, making it suitable for large data sets. Our implementation, written for use in a largescale 3D digitization project, launches quickly, maintains a usersettable interactive frame rate regardless of object complexity or camera position, yields reasonable image quality during motion
Results 1  10
of
1,120,896