Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
186
IOS Press Compact Representations and Efficient Algorithms for Operating Guidelines
"... Abstract. Operating guidelines characterize correct interaction (e. g., deadlock freedom) with a service. They can be stored in a service registry. They are typically represented as an annotated transition system where the annotations are Boolean formulae attached to the states. The core result of t ..."
Abstract
- Add to MetaCart
yields efficiency gains in several algorithms which involve operating guidelines. Finally we show that the new representation permits the translation of the transition system representing the operating guidelines into a Petri net which typically yields further gains concerning the space for storing
Similarity estimation techniques from rounding algorithms
- In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract
-
Cited by 449 (6 self)
- Add to MetaCart
to a compact representation of objects so that similarity of objects can be estimated from their compact sketches, and also leads to efficient algorithms for approximate nearest neighbor search and clustering. Min-wise independent permutations provide an elegant construction of such a locality
Binary Partition Tree as an Efficient Representation for Image Processing, Segmentation, and Information Retrieval
, 2000
"... This paper discusses the interest of Binary Partition Trees as a region-oriented image representation. Binary Partition Trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. They offer a multi-scale representation of the image a ..."
Abstract
-
Cited by 146 (9 self)
- Add to MetaCart
This paper discusses the interest of Binary Partition Trees as a region-oriented image representation. Binary Partition Trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. They offer a multi-scale representation of the image
Partial and approximate symmetry detection for 3D geometry
- ACM TRANSACTIONS ON GRAPHICS
, 2006
"... “Symmetry is a complexity-reducing concept [...]; seek it everywhere.” Alan J. Perlis Many natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models and efficiently discovers and extracts a com ..."
Abstract
-
Cited by 176 (26 self)
- Add to MetaCart
“Symmetry is a complexity-reducing concept [...]; seek it everywhere.” Alan J. Perlis Many natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models and efficiently discovers and extracts a
A.: Compact set representation for information retrieval
- In: SPIRE. Lecture
, 2007
"... Abstract. Conjunctive Boolean queries are a fundamental operation in web search engines. These queries can be reduced to the problem of intersecting ordered sets of integers, where each set represents the documents containing one of the query terms. But there is tension between the desire to store t ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
the lists effectively, in a compressed form, and the desire to carry out intersection operations efficiently, using non-sequential processing modes. In this paper we evaluate intersection algorithms on compressed sets, comparing them to the best non-sequential arraybased intersection algorithms. By adding a
Raster Set Representations with Efficient JOIN Operator
"... Some 3D computer graphics algorithms are using front-to-back scene traversal (for example hiddenline removal algorithms or fast form-factor computation) . In such methods each pixel has to be processed at most once. For this purpose various raster set representations can be used. This paper gives a ..."
Abstract
- Add to MetaCart
results measured in different computer architectures are included. 1 Motivation There are several computer graphics algorithms where compact and efficient raster set representation is wanted. We can point out methods using front-to-back traversals of 3D scene in the case that multiple processing of a
A thermal-driven floorplanning algorithm for 3D ICs
- in Proc. Int. Conf. Computer-Aided Design
, 2004
"... As the technology progresses, interconnect delays have become bottlenecks of chip performance. Three dimensional (3D) integrated circuits are proposed as one way to address this problem. However, thermal problem is a critical challenge for 3D IC circuit design. In this paper, we propose a thermal-dr ..."
Abstract
-
Cited by 105 (11 self)
- Add to MetaCart
-driven 3D floorplanning algorithm. Our contributions include, (1) a new 3D floorplan representation, CBA and new interlayer local operations to more efiiciently exploit the solution space; (2) an efficient thermal-driven 3D floorplanning algorithm with an integrated compact resistive network thermal model
Compact Representation of Web Graphs with Extended Functionality
, 2013
"... The representation of large subsets of the World Wide Web in the form of a directed graph has been extensively used to analyze structure, behavior, and evolution of those so-called Web graphs. However, interesting Web graphs are very large and their classical representations do not fit into the main ..."
Abstract
-
Cited by 7 (6 self)
- Add to MetaCart
into the main memory of typical computers, whereas the required graph algorithms perform inefficiently on secondary memory. Compressed graph representations drastically reduce their space requirements while allowing their efficient navigation in compressed form. While the most basic navigation operation
Orthogonal polyhedra: Representation and computation
- Schuppen (Eds.), Hybrid Systems: Computation and Control, LNCS 1569
, 1999
"... Abstract. In this paper we investigate orthogonal polyhedra, i.e. polyhedra which are finite unions of full-dimensional hyper-rectangles. We define representation schemes for these polyhedra based on their vertices, and show that these compact representation schemes are canonical for all (convex and ..."
Abstract
-
Cited by 42 (4 self)
- Add to MetaCart
and non-convex) polyhedra in any dimension. We then develop efficient algorithms for membership, face-detection and Boolean operations for these representations. 1
Efficient Data Representations for Information Retrieval
, 2007
"... The key role compression plays in efficient information retrieval systems has been recognized for some time. However, applying a traditional compression algorithm to the contents of an information retrieval system is often not the best solution. For example, it is inefficient to perform search opera ..."
Abstract
- Add to MetaCart
that operations be performed quickly. In particular, we are interested in variable length coding methods which are both practical and allow codeword boundaries to be found directly in the compressed representation. The latter property allows considerable flexibility in developing algorithms which can manipulate
Results 1 - 10
of
186
