• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 116
Next 10 →

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
indicates the transposed complex conjugate, and ⌿ is the n C ϫ n C receiver noise matrix (see Appendix A), which describes the levels and correlation of noise in the receiver channels. Using the unfolding matrix, signal separation is performed by where the resulting vector v has length n P and lists

Row-wise Parallel Predicate Evaluation

by Ryan Johnson, Vijayshankar Raman, et al.
"... Table scans have become more interesting recently due to greater use of ad-hoc queries and greater availability of multicore, vector-enabled hardware. Table scan performance is limited by value representation, table layout, and processing techniques. In this paper we propose a new layout and process ..."
Abstract - Cited by 14 (3 self) - Add to MetaCart
Table scans have become more interesting recently due to greater use of ad-hoc queries and greater availability of multicore, vector-enabled hardware. Table scan performance is limited by value representation, table layout, and processing techniques. In this paper we propose a new layout

Fast Column Scans: Paged Indices for In-Memory Column Stores

by Martin Faust, David Schwalb, Jens Krueger
"... Abstract. Commodity hardware is available in configurations with huge amounts of main memory and it is viable to keep large databases of enter-prises in the RAM of one or a few machines. Additionally, a reunification of transactional and analytical systems has been proposed to enable op-erational re ..."
Abstract - Add to MetaCart
-erational reporting on the most recent data. In-memory column stores appeared in academia and industry as a solution to handle the resulting mixed workload of transactional and analytical queries. Therein queries are processed by scanning whole columns to evaluate the predicates on non-key columns. This leads to a

Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects: The Evaluation Phase

by Reasey Praing, Markus Schneider
"... Topological predicates like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. They have been the subject of extensive interdisciplinary research. Spatial database systems and geographical information systems have shown a special interest in the ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
Topological predicates like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. They have been the subject of extensive interdisciplinary research. Spatial database systems and geographical information systems have shown a special interest

Intel GmbH

by Thomas Willhalm, Ismail Oukid, Franz Faerber, Ingo Müller, Sap Ag
"... The performance of the full table scan is critical for the overall performance of column-store database systems such as the SAP HANA database. Compressing the underlying column data format is both an advantage and a challenge, because it reduces the data volume involved in a scan on one hand and int ..."
Abstract - Add to MetaCart
and introduces the need for decompression during the scan on the other hand. In previous work [26] we have shown how to accelerate the column-scan with range predicates using SIMD instructions. In this paper, we present a framework for vectorized scans with more complex predicates. One important building block

A Conceptual Model and Predicate Language for Data Selection and Projection Based on Provenance

by David W. Archer, Lois M. L. Delcambre
"... Writing relational database queries over current provenance databases can be complex and error-prone because application data is typically mixed with provenance data, because queries may require recursion, and because the form in which provenance is maintained requires procedural parsing not easily ..."
Abstract - Add to MetaCart
Writing relational database queries over current provenance databases can be complex and error-prone because application data is typically mixed with provenance data, because queries may require recursion, and because the form in which provenance is maintained requires procedural parsing not easily

A column-oriented data stream engine

by E. Liarou, R. Goncalves, M. Kersten
"... This paper introduces the DataCell, a data stream management system designed as a seamless integration of continuous queries based on bulk event processing in an SQL software stack. The continuous stream queries are based on a predicate-window, called “basket ” expressions, which support arbitrary c ..."
Abstract - Add to MetaCart
complex SQL subqueries including, but not limited to, temporal and sequence constraints. The DataCell is designed for bulk event processing to capitalize proven relational column-store database technology to achieve efficient resource utilization. It is implemented on top of an open-source DBMS

CBIR Feature Vector Dimension Reduction with Eigenvectors of Covariance Matrix using Row, Column and Diagonal Mean Sequences Dr. H.B.Kekre

by Sudeep D. Thepade, Asst Prof, Akshay Maloo
"... Because of the rising demand from wide range of applications the need of faster and better image retrieval techniques is growing day by day. Dimension reduction of CBIR feature vectors has gained momentum for swift image retrieval. The paper presents few novel techniques for image retrieval based on ..."
Abstract - Add to MetaCart
on principal component analysis (PCA). Here feature vectors are eigenvectors of covariance matrix obtained using the row mean, column mean, forward diagonal mean, backward diagonal mean and mean combinations of database images. Instead of taking all pixels of database images for PCA, proposed CBIR methods use

Bringing Linear Algebra Objects to Life in a Column-Oriented In-Memory Database

by David Kernert, Wolfgang Lehner, Technische Universität Dresden
"... Abstract. Large numeric matrices and multidimensional data arrays appear in many science domains, as well as in applications of financial and business warehousing. Common applications include eigenvalue deter-mination of large matrices, which decompose into a set of linear algebra operations. With t ..."
Abstract - Add to MetaCart
. With the rise of in-memory databases it is now feasible to execute these complex analytical queries directly in the database without being restricted by hard disc latencies for random accesses. In this paper, we present a way to integrate linear algebra operations and large matrices as first class citizens

Dual-Tree Complex Wavelet Transform on Row Mean and Column Mean of Images for CBIR 1

by Dr. Nst Sai, Ravindra Patil
"... With the advancement in image capturing device, the image data been generated at high volume. If images are analyzed properly, they can reveal useful information to the human users. Content based image retrieval address the problem of retrieving images relevant to the user needs from image databases ..."
Abstract - Add to MetaCart
in the database by a vector of feature values called “Dual Tree Complex Wavelet Transform on row mean and column mean of images for CBIR”. This paper present 6 techniques for calculating feature vector of color image. As Dual-Tree Discrete Wavelet Transform decomposition level goes on increasing then feature
Next 10 →
Results 1 - 10 of 116
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University