Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
53,619
Representative Sets of Product Families
"... A subfamily F ′ of a set family F is said to q-represent F if for every A ∈ F and B of size q such that A ∩ B = ∅ there exists a set A ′ ∈ F ′ such that A ′ ∩ B = ∅. In a recent paper [SODA 2014] three of the authors gave an algorithm that given as input a family F of sets of size p together with ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
A subfamily F ′ of a set family F is said to q-represent F if for every A ∈ F and B of size q such that A ∩ B = ∅ there exists a set A ′ ∈ F ′ such that A ′ ∩ B = ∅. In a recent paper [SODA 2014] three of the authors gave an algorithm that given as input a family F of sets of size p together
Representing Moving Images with Layers
, 1994
"... We describe a system for representing moving images with sets of overlapping layers. Each layer contains an intensity map that defines the additive values of each pixel, along with an alpha map that serves as a mask indicating the transparency. The layers are ordered in depth and they occlude each o ..."
Abstract
-
Cited by 542 (11 self)
- Add to MetaCart
We describe a system for representing moving images with sets of overlapping layers. Each layer contains an intensity map that defines the additive values of each pixel, along with an alpha map that serves as a mask indicating the transparency. The layers are ordered in depth and they occlude each
An optimal representative set selection method
- Inform. Softw. Technol
, 2000
"... The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods
Generating Representative Web Workloads for Network and Server Performance Evaluation
, 1997
"... One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web worklo ..."
Abstract
-
Cited by 944 (11 self)
- Add to MetaCart
references; 5) temporal locality of reference; and 6) idle periods of individual users. This paper reviews the essential elements required in the generation of a representative Web workload. It also addresses the technical challenges to satisfying this large set of simultaneous constraints on the properties
CURE: An Efficient Clustering Algorithm for Large Data sets
- Published in the Proceedings of the ACM SIGMOD Conference
, 1998
"... Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new clustering ..."
Abstract
-
Cited by 722 (5 self)
- Add to MetaCart
clustering algorithm called CURE that is more robust to outliers, and identifies clusters having non-spherical shapes and wide variances in size. CURE achieves this by representing each cluster by a certain fixed number of points that are generated by selecting well scattered points from the cluster
REPRESENTING SETS WITH SUMS OF TRIANGULAR NUMBERS
, 2009
"... We investigate here sums of triangular numbers f(x): = ∑ biTxi where Tn is the n-th triangular number. We show that for a set of positive integers S there is a finite subset S0 such that f represents S if and only if f represents S0. However, computationally determining S0 is ineffective for many c ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We investigate here sums of triangular numbers f(x): = ∑ biTxi where Tn is the n-th triangular number. We show that for a set of positive integers S there is a finite subset S0 such that f represents S if and only if f represents S0. However, computationally determining S0 is ineffective for many
Representing Sets of Orientations as Convex Cones
"... Abstract-In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We address the problem of defining such sets and to find simple tests to verify if an orientation lies within a given set ..."
Abstract
- Add to MetaCart
set. The unit quaternion is used to represent the orientation of the rigid body and we develop three different sets of orientations that can easily be described by simple constraints in quaternion space. The three sets discussed can also be described as convex cones in R 3 defined by different norms
Sparse coding with an overcomplete basis set: a strategy employed by V1
- Vision Research
, 1997
"... The spatial receptive fields of simple cells in mammalian striate cortex have been reasonably well described physiologically and can be characterized as being localized, oriented, and ban@ass, comparable with the basis functions of wavelet transforms. Previously, we have shown that these receptive f ..."
Abstract
-
Cited by 958 (9 self)
- Add to MetaCart
for representing a given input, and so the input-output function will deviate from being purely linear. These deviations from linearity provide a potential explanation for the weak forms of non-linearity observed in the response properties of cortical simple cells, and they further make predictions about
Results 1 - 10
of
53,619
