629,013 Hits in 4.8 sec

Three generators for minimal writing-space computations

Serge Burckel, Marianne Morillon
2000 RAIRO - Theoretical Informatics and Applications  
The authors wish to thank some anonymous référée for his comments and for pointing out the link wit h Sophie Piccard's theorem.  ...  a minimal number of variables?  ...  A resuit of Piccard (see [4] ) implies that, for any finite set G, there are three mappings such that any mapping E : G->G has a décomposition into those three mappings (a transposition, an identification  ... 
doi:10.1051/ita:2000110 fatcat:ynsuzvs54ze5hi7u5vidmhm3j4

A Minimal Triple Space Computing Architecture

Christoph Bussler
2005 WSMO Implementation Workshop  
Triple Space Computing proposes to publish communication data analogous to the publication of Web pages: persistently for anybody to read who has access to it at any point in time.  ...  This article introduces a minimal Internet-scalable Triple Space Computing architecture based on Semantic Web technology that implements these four types of autonomy in the simplest way possible with as  ...  System Elements and Boundary From a bird's eye view, three main systems exist that operate together in Triple Space Computing. One main system is TSC clients.  ... 
dblp:conf/wiw/Bussler05 fatcat:mr7mqoluzfevfpxwy5e5mrjtlu


S. Mor, S. Filin
2012 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
three dimensions.  ...  The latter are commonly based on generating an entire map of matching.  ...  SURFACE RECONSTRUCTION Our surface reconstruction approach is based on minimizing the reprojection-error in the three-dimensional object space.  ... 
doi:10.5194/isprsannals-i-3-251-2012 fatcat:acrwwf2gyza3pmfbqcrwl7r5k4

Template Based Image Mosaics [chapter]

Yoon-Seok Choi, Bon-Ki Koo, Ji-Hyung Lee
2007 Lecture Notes in Computer Science  
Our approach controls overlap between tiles to minimize the gap by using the mask technique and adopts stackable technique to represent the fine detail of a source image automatically.  ...  Whenever a space is filled with tiles, the space of write mask which is corresponding to the filled space is set to 1. In order to minimize gap between tiles, the size of a tile can be reduced.  ...  The filling process is repeated until there is no space for tile filling.  ... 
doi:10.1007/978-3-540-74873-1_64 fatcat:o2djxluab5aqbkkihjuldc3kwm

Current Open Problems in Discrete and Computational Geometry

H. Edelsbrunner, A. Ivanov, R. Karasev
2015 Modelirovanie i Analiz Informacionnyh Sistem  
In all the cases, it is not difficult to write a computer program that calculates the Fermat point or the locally minimal tree for a small number of boundary points numerically.  ...  The classical Fermat Problem asks for a point X in the Euclidean plane that minimizes the sum of distances from three fixed points A i , which we write as f (X) = |A 1 X| + |A 2 X| + |A 3 X|.  ... 
doi:10.18255/1818-1015-2012-5-5-17 fatcat:kdwxuzi2azenlpoxfmg2e3ruia

PL1P - Point-line Minimal Problems under Partial Visibility in Three Views

Timothy Duff, Kathlen Kohn, Anton Leykin, Tomas Pajdla
2020 Zenodo  
Scientific paper, titled "PL1P - Point-line Minimal Problems under Partial Visibility in Three Views", presented during the ECCV 2020 Conference, co-funded by the H2020 ARtwin project (GA:856994).  ...  On the implementation level, this minimality criterion requires writing down local coordinates for the various projective spaces and Grassmannians.  ...  We provide a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at  ... 
doi:10.5281/zenodo.4335175 fatcat:jaq3ardq6vembaa2yxmqlge324

On the Benefits of Transparent Compression for Cost-Effective Cloud Data Storage [chapter]

Bogdan Nicolae
2011 Lecture Notes in Computer Science  
We aim at reducing the storage space and bandwidth needs with minimal impact on data access performance.  ...  This paper evaluates the trade-off resulting from transparently applying data compression to conserve storage space and bandwidth at the cost of slight computational overhead.  ...  ALADDIN-G5K experimental testbed, an initiative from the French Ministry of Research through the ACI GRID incentive action, INRIA, CNRS and RE-NATER and other contributing partners (see for  ... 
doi:10.1007/978-3-642-23074-5_7 fatcat:jg5sygkarbg7vmyyztjeqhx3ei

Minimizing write operation for multi-dimensional DSP applications via a two-level partition technique with complete memory latency hiding

Yan Wang, Kenli Li, Keqin Li
2015 Journal of systems architecture  
In this paper, we develop a Two-Level Partition (TLP) algorithm that can minimize write operation while achieving full parallelism for multi-dimensional DSP applications running on CMPs which employ scratchpad  ...  First, as most of the digital signal processing applications are both computation intensive and data intensive, an inefficient scheduling scheme may generate huge amount of write operation, cost a lot  ...  Acknowledgments The authors would like to thank the two anonymous reviewers for their comments which have helped to improve the manuscript.  ... 
doi:10.1016/j.sysarc.2015.02.001 fatcat:wsy2rf3oj5gyza5ggsokfhxxaq

PLMP – Point-Line Minimal Problems in Complete Multi-View Visibility [article]

Timothy Duff and Kathlén Kohn and Anton Leykin and Tomas Pajdla
2019 arXiv   pre-print
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras.  ...  We show that there are only 30 minimal problems in total, no problems exist for more than 6 cameras, for more than 5 points, and for more than 6 lines.  ...  Contribution We give a complete classification of minimal problems for generic arrangements of points and lines, including their incidences, completely observed by any number of calibrated perspective  ... 
arXiv:1903.10008v2 fatcat:xue4aeopdnarzgzb3ddy5bz26e

Minimizing algebraic error

R. I. Hartley
1998 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
This provides new algorithms for the problems of resectioning a pinhole camera, computing the fundamental matrix, and computing the tri-focal tensor. 2.  ...  This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision.  ...  Furthermore, the generators of the three left null-spaces have a common perpendicular, the epipole e 21 . Figure 2 : 2 The  ... 
doi:10.1098/rsta.1998.0216 fatcat:dc3l5qt6fretlmdttmvz2s5bbq

Page 2641 of Mathematical Reviews Vol. , Issue 88e [page]

1988 Mathematical Reviews  
Not surprisingly, it also turns out that the boundedness problem becomes undecidable for some generalizations of the authors’ spe- cial CFSM.  ...  For a given set of minimal keys, we construct also an algorithm that finds the set of all antikeys.  ... 

Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver

Sandhya Krishnan, Sriram Krishnamoorthy, Gerald Baumgartner, Chi-Chung Lam, J. Ramanujam, P. Sadayappan, Venkatesh Choppella
2006 Journal of Parallel and Distributed Computing  
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions.  ...  This entails a search in an explosively large parameter space.  ...  We are grateful to the Ohio Supercomputer Center (OSC) for the use of their computing facilities.  ... 
doi:10.1016/j.jpdc.2005.06.017 fatcat:vbkqcart6jeyrals3umw2uqohe

Jointly optimized error-feedback and realization for roundoff noise minimization in state-space digital filters

Wu-Sheng Lu, T. Hinamoto
2005 IEEE Transactions on Signal Processing  
In this paper, we propose a method for the joint optimization of error feedback and state-space realization.  ...  With a closed-form formula for gradient evaluation and an efficient quasi-Newton solver, the unconstrained minimization problem can be solved efficiently.  ...  In this paper, the problem of joint optimization of errorfeedback and state-space realization for RN minimization is investigated in a general nonlinear optimization frame-work where the error-feedback  ... 
doi:10.1109/tsp.2005.847847 fatcat:fmb2fl22yjavvjnx6rlrz2a65a

Page 639 of Mathematical Reviews Vol. , Issue 2000a [page]

2000 Mathematical Reviews  
639 68Q Theory of computing of view, what is stored is not the semantics of a database, but rather a minimal subset Y of , which can generate / using the constraints.  ...  Summary: “We define and justify a natural sequential model of computation with a constant amount of read/write work space, despite unlimited (polynomial) access to read-only input and write- only output  ... 

2-D lattice discrete filters: minimal delay and state space realization

G.E. Antoniou
2001 IEEE Signal Processing Letters  
A circuit realization is presented for two-dimensional (2-D) lattice discrete filters. The number of delay elements is minimal.  ...  Based on this circuit realization, the corresponding state space realization is derived. The matrices A, b, c , and the scalar of the 2-D state space model are presented in generalized form.  ...  is generated as shown in Fig. 1 .  ... 
doi:10.1109/97.889640 fatcat:sn2yi2hkcvcmpn6nllwukx6bpq
« Previous Showing results 1 — 15 out of 629,013 results