205,881 Hits in 2.8 sec

Empirical testing of algorithms for variable-sized label placement

Jon Christensen, Stacy Friedman, Joe Marks, Stuart M. Shieber
1997 Proceedings of the thirteenth annual symposium on Computational geometry - SCG '97  
The development of methods for placing labels on map features is a central problem in automated cartography.  ...  Finally, we address the question of whether the clever preprocessing method used in WW might be advantageously applied to PFLP by using it as a preprocessing step for SA, and show that it provides no advantage  ...  Acknowledgements This paper is baaed upon work supported in part by the National Science Foundation under Grant Number IRI-9350192 and by a gift from MERL -A Mitsubishi Electric Research Laboratory.  ... 
doi:10.1145/262839.263039 dblp:conf/compgeom/ChristensenFMS97 fatcat:vpugbhvdpzhbdjogr2hhbf5ftm

Approximate String Matching with Reduced Alphabet [chapter]

Leena Salmela, Jorma Tarhio
2010 Lecture Notes in Computer Science  
We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet.  ...  Our experiments show that the alphabet reduction makes the algorithm faster.  ...  We thank the referee, who helped us to improve this paper.  ... 
doi:10.1007/978-3-642-12476-1_15 fatcat:gydq2nixeffyth52ownkzgakd4

Overcoming slowly decaying Kolmogorov n-width by transport maps: application to model order reduction of fluid dynamics and fluid–structure interaction problems [article]

Monica Nonino and Francesco Ballarin and Gianluigi Rozza and Yvon Maday
2019 arXiv   pre-print
Such preprocessing is based on the composition of the snapshots with a transport map, that is a family of smooth and invertible mappings that map the physical domain of the problem into itself.  ...  In particular, we employ an additional preprocessing during the offline phase of the reduced basis method, in order to obtain smaller reduced basis spaces.  ...  The computations in this work have been performed with multiphenics [2] , which is a library that aims at providing tools in FEniCS [34] for an easy prototyping of multiphysics problems on conforming  ... 
arXiv:1911.06598v1 fatcat:oifpl373qvcgxosyoqyiaalvhm

Depth No-Synthesis-Error Time-Consistent Preprocessing for Depth Coding in FVV System

Fengfei Sun, Gangyi Jiang, YunZhang, Mei Yu, Zongju Peng, Feng Shao
2012 Procedia Engineering  
Based on the above analyses, this paper proposes a depth no-synthesis-error time-consistent preprocessing algorithm to improve depth map sequences compression ratio..  ...  virtual view with the original depth map.  ...  However, weak temporal correlation of depth map sequence seriously decreases its compression ratio. This paper proposed a preprocessing algorithm to address the problem.  ... 
doi:10.1016/j.proeng.2012.01.353 fatcat:z7i5iyqkcvarfd6ntyaxy3dxkm

Map Merging in the Context of Image Processing

Ilze Andersone
2011 Scientific Journal of Riga Technical University Computer Sciences  
Algorithms from image processing can also be used in map merging for map preprocessing.  ...  Map Merging in the Context of Image Processing The area of map merging is tightly connected to the area of image processing. Usually metric maps created by robots are represented as occupancy grids.  ...  INTRODUCTION One of the fundamental problems in mobile robotics is the environment mapping problem. Robots need to be able to construct a map of the environment and to use it for navigation.  ... 
doi:10.2478/v10143-011-0030-5 fatcat:7ms75qf62vce5j7lb67vzpxhkm

Mapper: an intelligent restriction mapping tool

J. A. Inglehart, P. C. Nelson, Y. Zou
1998 Bioinformatics  
Motivation: To determine the most powerful artificial intelligence techniques for automated restriction mapping, and use them to create a powerful multiple-enzyme restriction mapping tool.  ...  Additional experimentation led to the development of an input preprocessing module which significantly speeds up searches, and an output post-processing module which enables users to analyze large solution  ...  The authors are indebted to Steven Weaver and Donald Morrison of the University of Illinois at Chicago's Laboratory of Molecular Biology, who provided domain expertise in DNA restriction mapping, and to  ... 
doi:10.1093/bioinformatics/14.2.101 pmid:9545441 fatcat:lllpwl3fk5frzm7or63qny46yq

A data preprocessing framework for supporting probability-learning in dynamic decision modeling in medicine

F Zhao, T Y Leong
2000 Proceedings. AMIA Symposium  
This paper presents a framework to facilitate automated and interactive generation of the problem-specific data preprocessing scripts.  ...  3) A script generator that automatically generates the specific database scripts for the data preprocessing.  ...  This research was supported by a strategic research grant RP960351 from the National Science and Technology Board and the Ministry of Education of Singapore.  ... 
pmid:11080021 pmcid:PMC2243981 fatcat:nfphbawxxferhi372raxusnyju

A programmable array processor architecture for flexible approximate string matching algorithms

Panagiotis D. Michailidis, Konstantinos G. Margaritis
2007 Journal of Parallel and Distributed Computing  
Further, we describe the architecture of the array and the architecture of the cell in detail in order to efficiently implement for both the preprocessing and searching phases of most string matching algorithms  ...  Our architecture maximizes the strength of VLSI in terms of intensive and pipelined computing and yet circumvents the limitation on communication.  ...  An Implementation of the Preprocessing Phase In this section the implementation of the preprocessing phase, i.e. the construction of the bit-level memory map R and M is discussed.  ... 
doi:10.1016/j.jpdc.2006.10.002 fatcat:x3f7ii3l4fcknini54mssr7dky

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
We thank anonymous reviewers for helpful comments to improve the presentation of the paper.  ...  Informal description of preprocessing. Algorithm Preprocess associates with each bag B a local distance map LDB : B × B → Σ.  ...  The maps are IFDS/IDE framework.  ... 
doi:10.1145/2676726.2676979 dblp:conf/popl/ChatterjeeIPG15 fatcat:zh63zfdwafdajm4touu2uhzga4

A foreground biased depth map refinement method for DIBR view synthesis

Xuyuan Xu, Lai-Man Po, Kwok-Wai Cheung, Ka-Ho Ng, Ka-Man Wong, Chi-Wang Ting
2012 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
This paper presents a simple and efficient depth map preprocessing method with use of texture edge information to refine depth pixels around the large depth discontinuities.  ...  Pre-filtering approach and reliability-based approach have been proposed to tackle this problem.  ...  Fig. 3: Depth map boundaries misalignment problem.  ... 
doi:10.1109/icassp.2012.6288006 dblp:conf/icassp/XuPCNWT12 fatcat:7fd7scy6zbdkxplf5ahnj6d5g4

Toward the Automatic Generation of the Entry Level CDA Documents

Sungwon Jung, Seunghee Kim, Sooyoung Yoo, Jinwook Choi
2009 Journal of Korean Society of Medical Informatics  
In this paper, we evaluate the accuracy of text mapping methods which are based on NLP.  ...  The precision was as follows: 86.5% for diagnosis, 61.8% for chief complaint, 62.7%, for problem list, and 64.8% for discharge medication.  ...  In case of Exact Mapping, the result was from trying Exact Mapping alone. In case of Preprocessing Mapping, the result was from summing up Exact Mapping rate and Preprocessing Mapping rate.  ... 
doi:10.4258/jksmi.2009.15.1.141 fatcat:llyvpspifvczzlnjpqa3hn2rle

Page 1535 of Neural Computation Vol. 8, Issue 7 [page]

1996 Neural Computation  
On the other hand, we have a cascade of multiple nets all trying to map the same input, but on the basis of differently refined preprocessing provided by the prede- cessors in the cascade.  ...  Cascade Network Architectures 1535 confirming our results for the XOR problem and yielding results for other benchmarks like the two-spiral problem or the soybean data set.  ... 

Belief Propagation for Stereo Analysis of Night-Vision Sequences [chapter]

Shushi Guan, Reinhard Klette, Young W. Woo
2009 Lecture Notes in Computer Science  
As shown in [4], Sobel preprocessing of images has obvious impacts on improving disparity calculations.  ...  This paper considers other options of preprocessing (Canny and Kovesi-Owens edge operators), and concludes with a recommended setting for belief propagation on those sequences.  ...  For example, depth maps for Sequence 1 show mismatches in the sky (top right), and the road is not a smooth, even surface. Similar problems occur in the depth maps of Sequence 2.  ... 
doi:10.1007/978-3-540-92957-4_81 fatcat:kq3xayxxwnf4zcnbrpisrdcvry

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth [article]

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
2014 arXiv   pre-print
RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, etc.  ...  The study of multiple queries allows us to bring in a very important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query.  ...  We thank anonymous reviewers for helpful comments to improve the presentation of the paper.  ... 
arXiv:1410.7724v2 fatcat:y2xp2pmulbfknhkthoh2kbo7xe

Information Maps: A Practical Approach to Position Dependent Parameterization [article]

Benjamin wilking, Daniel Meissner, Stephan Reuter, Klaus Dietmayer
2013 arXiv   pre-print
Thus, for instance, it is feasible to store arbitrary attributes of a sensor's preprocessing in an Information Map and utilize them by simply taking the map value at the current position.  ...  The Information Map is meant to be a simple and practical approach to the problem of position dependent parameterization in all kind of algorithms when the analytical description is not possible or can  ...  Therefore the preprocessing has attributes completely different to those of the sensor itself. A further problem occurs when combining sensors in a preprocessing step.  ... 
arXiv:1312.3808v1 fatcat:kgnea45mtnaoppe7jjbt2eruve
« Previous Showing results 1 — 15 out of 205,881 results