共查询到20条相似文献,搜索用时 15 毫秒
1.
Scale-space behaviour of local extrema and blobs 总被引:4,自引:0,他引:4
Tony Lindeberg 《Journal of Mathematical Imaging and Vision》1992,1(1):65-99
2.
Frank Dehne 《The Visual computer》1988,3(6):356-370
In this paper we study parallel algorithms for the Mesh-of-Processors architecture to solve visibility and related separability problems for sets of simple polygons in the plane. In particular, we present the following algorithms: - AnO( \(\sqrt N\) time algorithm for computing on a Mesh-of-Processors of size N the visibility polygon from a point located in anN-vertex polygon, possibly with holes. -O( \(\sqrt N\) ) time algorithms for computing on a Mesh-of-Processors of sizeN the set of all points on the boundary of anN-vertex polygonP which are visible in a given directiond as well as the visibility hull ofP for a given directiond. - AnO( \(\sqrt N\) ) time algorithm for detecting on a Mesh-of-Processors of size 2N whether twoN-vertex polygons are separable in a given direction and anO( \(\sqrt {MN}\) ) time algorithm for detecting on a Mesh-of-Processors of sizeMN whetherM N-vertex polygons are sequentially separable in a given direction. All proposed algorithms are asymptotically optimal (for the Mesh-of-Processors) with respect to time and number of processors. 相似文献
3.
In this paper we give efficient parallel algorithms for a number of problems from computational geometry by using versions of parallel plane sweeping. We illustrate our approach with a number of applications, which include: General hidden-surface elimination (even if the overlap relation contains cycles). CSG boundary evaluation. Computing the contour of a collection of rectangles. Hidden-surface elimination for rectangles. There are interesting subproblems that we solve as a part of each parallelization. For example, we give an optimal parallel method for building a data structure for line-stabbing queries (which, incidentally, improves the sequential complexity of this problem). Our algorithms are for the CREW PRAM, unless otherwise noted. 相似文献
4.
We settle all relativized questions of the relationships between the following five propositions:
- P = NP.
- P = UP.
- P = NP $\cap$ coNP.
- All disjoint pairs of NP sets are P-separable.
- All disjoint pairs of coNP sets are P-separable.
5.
S. De Zuccoli 《Calcolo》1981,18(1):19-40
We introduce a numerical method for solving nonlinear algebraic equations related to linear least squares fitting with moving weights. The method considered introduces little overhead in the process. The approach is based on updating two matrices so that the product is an approximation of the inverse Jacobian. We may expect:
- The tecnique performs good for stochastic systems
- We never may yield an unbounded correction
- We can use the algorithm for ill-conditioned, also completely singular problems.
6.
María Victoria Cengarle Luis Mandel Martin Wirsing Heiner Brand Klaus Däßler Thekla Schneider 《Higher-Order and Symbolic Computation》1992,4(4):319-369
A DIN Kernel LISP Draft (DKLisp) has been developed by DIN as Reaction to Action D1 (N79), short term goal, of ISO WG16. It defines a subset language, as compatible as possible with the ANSICommon-Lisp draft, but also with theEuLisp draft. It combines the most important LISP main stream features in a single, compact, but nevertheless complete language definition, which thereby could be well suited as basis for a short term InternationalLisp Standard. Besides the functional and knowledge processing features, the expressive power of the language is well comparable with contemporary procedural languages, as e.g. C++ (of course without libraries). Important features ofDKLisp are: to be a “Lisp-1,” but allowing an easy “Lisp-2” transformation; to be a simple, powerful and standardized educationalLisp; to omit all features, which are unclean or in heavy discussion; DKLisp programs run nearly unchanged inCommon-Lisp; DKLisp contains a simple object and package system; DKLisp contains those data classes and control structures also common to most modernLisp and non-Lisp languages; DKLisp offers a simple stream I/O; DKLisp contains a clean unified hierarchical class/type system; DKLisp contains the typical “Lisp-features” in an orthogonal way; DKLisp allows and encourages really small but powerful implementations; DKLisp comes in levels, so allowing ANSICommon-Lisp to be an extension ofDKLisp level-1. The present is the second version of the proposal, namely version 1.2, with slight differences with respect to the one sent to ISO. Sources of such changes were the remarks generously sent by many readers of the previous attempt. 相似文献
7.
The general specifications and design for a High-Speed General Information Management System, HSGIMS, to serve as the basis for a Global Information Network are given. Some of the key specifications that have been confirmed in experiments with a prototype of the HSGIMS are:
- Information (or data) and Question-type (or logical data) independence.
- Very small bounded search times that are independent of the amount of information that is managed and can be computed exactly.
- A fool-proof security system that can be used to protect databases against viruses and can also be easily invoked to deny unauthorized access by users.
- Efficient use of all storage and communications resources.
8.
M. Pellegrini 《Algorithmica》1993,9(5):471-494
We present a uniform approach to problems involving lines in 3-space. This approach is based on mapping lines inR 3 into points and hyperplanes in five-dimensional projective space (Plücker space). We obtain new results on the following problems:
- Preprocessn triangles so as to answer efficiently the query: “Given a ray, which is the first triangle hit?” (Ray- shooting problem). We discuss the ray-shooting problem for both disjoint and nondisjoint triangles.
- Construct the intersection of two nonconvex polyhedra in an output sensitive way with asubquadratic overhead term.
- Construct the arrangement ofn intersecting triangles in 3-space in an output-sensitive way, with asubquadratic overhead term.
- Efficiently detect the first face hit by any ray in a set of axis-oriented polyhedra.
- Preprocessn lines (segments) so as to answer efficiently the query “Given two lines, is it possible to move one into the other without crossing any of the initial lines (segments)?” (Isotopy problem). If the movement is possible produce an explicit representation of it.
9.
Tom Conlon 《Artificial Intelligence Review》1992,6(3):285-324
If you are familiar with Prolog but not with Parlog then this tutorial is aimed at you. In what follows I attempt to: ? explain the basics of Parlog ? demonstrate that Parlog programs can be powerful and elegant ? discuss the relationship of Parlog to Prolog, and ? identify some resources which will take you further. These are what I call ‘four steps to Parlog’. 相似文献
10.
This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn. We define two types of assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare-logic inspired. In particular the feedback rules employ invariants in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also (semantic) relative complete. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. 相似文献
11.
Foued Ameur Paul Fischer Klaus -U. Höffgen Friedhelm Meyer auf der Heide 《Acta Informatica》1996,33(5):621-630
A pac-learning algorithm isd-space bounded, if it stores at mostd examples from the sample at any time. We characterize thed-space learnable concept classes. For this purpose we introduce the compression parameter of a concept classb and design our Trial and Error Learning Algorithm. We show: b isd-space learnable if and only if the compression parameter ofb is at mostd. This learning algorithm does not produce a hypothesis consistent with the whole sample as previous approaches e.g. by Floyd, who presents consistent space bounded learning algorithms, but has to restrict herself to very special concept classes. On the other hand our algorithm needs large samples; the compression parameter appears as exponent in the sample size. We present several examples of polynomial time space bounded learnable concept classes: - all intersection closed concept classes with finite VC-dimension. - convexn-gons in ?2. - halfspaces in ?n. - unions of triangles in ?2. We further relate the compression parameter to the VC-dimension, and discuss variants of this parameter. 相似文献
12.
Valery M. Tsourikov 《AI & Society》1993,7(1):62-77
Inventive Machine project is the matter of discussion. The project aims to develop a family of AI systems for intelligent support of all stages of engineering design. Peculiarities of the IM project:
- deep and comprehensive knowledge base — the theory of inventive problem solving (TIPS)
- solving complex problems at the level of inventions
- application in any area of engineering
- structural prediction of engineering system development
13.
Dr.-Ing. Rolf Reinema 《WIRTSCHAFTSINFORMATIK》2002,44(4):367-373
The RoomComputer is an embedded system and as such offers unprecedented chances to manage buildings. Several RoomComputers can be networked via the Intra-/Internet, which makes it possible to monitor, control, and manage rooms and buildings on a unified worldwide accessible platform, irrespective of any particular local technology. It can be easily installed in any building and gives access to a full set of services. It implements a distributed system, which provides secure and controlled access to services like
- control of light, heating, ventilation, air and climate
- communication facilities like unified messaging, telephone, fax, etc.
- reservation of rooms and required resources
- localization of persons and equipment within rooms and buildings
- entrance control (i.e. locking/unlocking doors)
- organization of maintenance and house keeping, and
- charging and billing.
14.
This paper presents a kernel language KLND on the basis of analysing the kernel languagerequirements of new generation computer systems. These requirements are: the ability ofknow-ledge processing, the parallelism, the elegant mathematical properties of the comput-ation model which is appropriate for working as the basis of the novel architecture design, andthe suitability for writing large scale softwares. The main features of KLND are as follows: 1. several new language concepts. 2. the modularity, 3. the unification of logical and functional programming styles, 4. the exploitation of the parallelism. 5. the introduction of the type concept, 6. the introduction of the storage concept. 相似文献
15.
We define a class ofn-ary relations on strings called the regular prefix relations, and give four alternative characterizations of this class:
- the relations recognized by a new type of automaton, the prefix automata,
- the relations recognized by tree automata specialized to relations on strings,
- the relations between strings definable in the second order theory ofk successors,
- the smallest class containing the regular sets and the prefix relation, and closed under the Boolean operations, Cartesian product, projection, explicit transformation, and concatenation with Cartesian products of regular sets.
16.
Christian Choffrut Flavio D’Alessandro Stefano Varricchio 《Theory of Computing Systems》2010,46(2):351-369
In this paper, for a finitely generated monoid M, we tackle the following three questions:
- Is it possible to give a characterization of rational subsets of M which have polynomial growth?
- What is the structure of the counting function of rational sets which have polynomial growth?
- Is it true that every rational subset of M has either exponential growth or it has polynomial growth? Can one decide for a given rational set which of the two options holds?
17.
The main contribution of the present article consists of new 3D parallel and symmetric thinning schemes which have the following qualities: They are effective and sound, in the sense that they are guaranteed to preserve topology. This guarantee is obtained thanks to a theorem on critical kernels; They are powerful, in the sense that they remove more points, in one iteration, than any other symmetric parallel thinning scheme; They are versatile, as conditions for the preservation of geometrical features (e.g., curve extremities or surface borders) are independent of those accounting for topology preservation; They are efficient: we provide in this article a small set of masks, acting in the grid ?3, that is sufficient, in addition to the classical simple point test, to straightforwardly implement them. 相似文献
18.
We define the complexity of a computational problem given by a relation using the model of computation trees together with the Ostrowski complexity measure. Natural examples from linear algebra are: KER n : Compute a basis of the kernel for a givenn×n-matrix, OGB n : Find an invertible matrix that transforms a given symmetricn×n-matrix (quadratic form) into diagonal form, SPR n : Find a sparse representation of a givenn×n-matrix. 相似文献
19.
The continuation method, well-established for the solution of nonlinear equations is extended to restricted optimization problems. Only the locally active restrictions are considered along the homotopy path. It is assumed that there are only finitely many critical points, i. e. that there are only finitely many changes of the index set of active restrictions. The globally convergent algorithm which we present proceeds in three stages:
- Within each stability region, the solution is computed by the classical continuation method.
- On the boundary of a stability region, a critical point \(\bar t\) is determined.
- A new active index set is determined when \(\bar t\) is passed.