Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,377
Complex of abstract cubes and median problem
- COMPUTER SCIENCE JOURNAL OF MOLDOVA, VOL.19, NO.1(55), 2011
, 2011
"... In this paper a special complex K n of abstract cubes [2, 3], which contains only n-dimensional cubes is examined. The border of this complex is an abstract (n − 1)-dimensional sphere. It is proved that the abstract sphere contains at least one 0-dimensional cube, which belongs to exactly n cubes wi ..."
Abstract
- Add to MetaCart
In this paper a special complex K n of abstract cubes [2, 3], which contains only n-dimensional cubes is examined. The border of this complex is an abstract (n − 1)-dimensional sphere. It is proved that the abstract sphere contains at least one 0-dimensional cube, which belongs to exactly n cubes
Jumping doesn’t help in abstract cubes, in
- Proc. 11th Conference on Integer Programming and Combinatorial Optimization (IPCO
, 2005
"... Abstract. We construct a class of abstract objective functions on the cube, such that the algorithm BottomAntipodal takes exponentially many steps to find the maximum. A similar class of abstract objective functions is constructed for the process BottomTop, also requiring exponentially many steps. ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Abstract. We construct a class of abstract objective functions on the cube, such that the algorithm BottomAntipodal takes exponentially many steps to find the maximum. A similar class of abstract objective functions is constructed for the process BottomTop, also requiring exponentially many steps.
Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals
, 1996
"... Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization of these op ..."
Abstract
-
Cited by 860 (11 self)
- Add to MetaCart
Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization
Efficient dispersal of information for security, load balancing, and fault tolerance
- Journal of the ACM
, 1989
"... Abstract. An Information Dispersal Algorithm (IDA) is developed that breaks a file F of length L = ( F ( into n pieces F,, 1 5 i 5 n, each of length ( F, 1 = L/m, so that every m pieces suffice for reconstructing F. Dispersal and reconstruction are computationally efficient. The sum of the lengths ..."
Abstract
-
Cited by 561 (1 self)
- Add to MetaCart
Abstract. An Information Dispersal Algorithm (IDA) is developed that breaks a file F of length L = ( F ( into n pieces F,, 1 5 i 5 n, each of length ( F, 1 = L/m, so that every m pieces suffice for reconstructing F. Dispersal and reconstruction are computationally efficient. The sum of the lengths
Abstract Cube Lattices: a Framework for Multidimensional Data Mining
"... Constrained multidimensional patterns differ from the well-known frequent patterns from a conceptual and logical points of view because they are provided with a common structure and support various types of constraints. Classical data mining techniques are based on the power set lattice of binary at ..."
Abstract
- Add to MetaCart
attributes and, even extended, are not suitable when addressing the discovery of constrained multidimensional patterns. In this paper we propose a foundation for various multidimensional data mining problems by introducing a new algebraic structure called cube lattice which characterizes the search space
Planning as heuristic search,
- 5 – 33, ISSN
, 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract
-
Cited by 421 (33 self)
- Add to MetaCart
Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting
The Rho Cube
- In Proc. of FOSSACS, volume 2030 of LNCS
, 2001
"... www.loria.fr/{~cirstea,~ckirchne,~lliquori} Abstract. The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting and λ-calculus. The original presentation of the calculus was unty ..."
Abstract
-
Cited by 39 (19 self)
- Add to MetaCart
www.loria.fr/{~cirstea,~ckirchne,~lliquori} Abstract. The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting and λ-calculus. The original presentation of the calculus
Abstract Discretized Marching Cubes
"... Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. This paper presents an algorithm that considerably reduces the number of polygons generated by a Marching ..."
Abstract
- Add to MetaCart
Cubes-like scheme without excessively increasing the overall computational complexity. The algorithm assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions, the extracted surfaces are composed of polygons lying within a finite
Results 1 - 10
of
2,377
