• 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 129
Next 10 →

ON THE RESONANCES OF CONVEX CO-COMPACT SUBGROUPS OF ARITHMETIC GROUPS

by Dmitry Jakobson, Frédéric Naud
"... Abstract. Let Λ be a non-elementary convex co-compact fuchsian group which is a subgroup of an arithmetic fuchsian group. We prove that the Laplace operator of the hyperbolic surface X = Λ\H 2 has infinitely many resonances in an effective strip depending on the dimension of the limit set δ. Applica ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. Let Λ be a non-elementary convex co-compact fuchsian group which is a subgroup of an arithmetic fuchsian group. We prove that the Laplace operator of the hyperbolic surface X = Λ\H 2 has infinitely many resonances in an effective strip depending on the dimension of the limit set δ

NIC-based Reduction Algorithms for Large-scale Clusters

by Fabrizio Petrini, Adam Moody, Juan Fernandez, Eitan Frachtenberg, Dhabaleswar K. Panda - International Journal of High Performance Computing and Networking (IJHPCN , 2005
"... Abstract — Efficient algorithms for reduction operations across a group of processes are crucial for good performance in many large-scale, parallel scientific applications. While previous algorithms limit processing to the host CPU, we utilize the programmable processors and local memory available o ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract — Efficient algorithms for reduction operations across a group of processes are crucial for good performance in many large-scale, parallel scientific applications. While previous algorithms limit processing to the host CPU, we utilize the programmable processors and local memory available

Group-invariant Semidefinite Programming and Applications

by Minyan Ni , H Xu , S Pan , G Kemkes , H Wei , A Li , S Luo , etc. Z Zhou
"... Abstract This essay considers semidefinite programming problems that exhibit a special form of symmetry called group-invariance. We demonstrate the effect of such symmetries on certain path-following interior-point algorithms, and highlight a reduction technique that is particularly useful on certa ..."
Abstract - Add to MetaCart
Abstract This essay considers semidefinite programming problems that exhibit a special form of symmetry called group-invariance. We demonstrate the effect of such symmetries on certain path-following interior-point algorithms, and highlight a reduction technique that is particularly useful

Rectilinear Group Steiner Trees and Applications in VLSI Design

by Martin Zachariasen, André Rohe , 2000
"... Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of finding a shortest interconnection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectiline ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
algorithm for solving the rectilinear group Steiner tree problem (and related variants of the problem). The algorithm essentially constructs a subgraph of the corresponding Hanan grid on which existing algorithms for solving the Steiner tree problem in graphs are applied. The reductions of the Hanan

An algorithm for the arithmetic classification of multilattices

by Giuliana Indelicato , 908
"... A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine whether two multilattices are arithmetically equivalent. The ..."
Abstract - Add to MetaCart
. The algorithm is based on ideas from integer matrix theory, in particular the reduction to the Smith normal form. Among the applications of this procedure is a software package that allows the classification of complex crystalline structures and the determination of their space groups. Also, it can be used

Credit Card Fraud Detection with a Neural-Network,”

by Sushmito Ghosh , Douglas L Reilly - Proc. 27th Hawaii Int‟l Conf. System Sciences: Information Systems: Decision Support and Knowledge-Based Systems, , 1994
"... Abstract Using data from a credit card issuer, a neural network based fraud detection system was trained on a large sample of labelled credit card account transactions and tested on a holdout data set that consisted of all account activity over a subsequent two-month period of time. The neural netw ..."
Abstract - Cited by 74 (0 self) - Add to MetaCart
it is a new issue) or cardholder information file. Such programs, though expensive, have led to reductions in NRI losses. Additional fraud schemes involve the submission of fraudulent applications for a card. In such cases, perpetrators obtain access to actual personal background and financial information

ALGEBRAIC ALGORITHMS1

by Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas, Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas , 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract - Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-

Optimal Wireless Access Point Placement For . . .

by Roberto Battiti, Mauro Brunato, Andrea Delai , 2003
"... In mobile computing scenarios, context-aware applications are more effective in relieving from the mobile user the burden of introducing information that can be automatically derived from the environment. In particular, the physical position of the mobile system (and hence of the user) is fundamenta ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
) is fundamental for many types of applications. User position estimation methods based on strength of the radio signals received from multiple wireless access points have been recently proposed and implemented by several independent research groups. In this paper a new approach to wireless access point placement

12 3-Manifold Groups are Virtually Residually p

by Matthias Aschenbrenner, Stefan Friedl, Sr. M. Benigna Fehlner
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Issues in the acquisition, processing, reduction and parameterization of articulographic data.

by Philip Hoole Munich
"... This report will give an overview of the chain of procedures involved in acquiring reliable articulographic data, up to the point at which parameters have been extracted and are available for statistical processing. The topics to be covered are divided into two groups. The first group involves proce ..."
Abstract - Add to MetaCart
This report will give an overview of the chain of procedures involved in acquiring reliable articulographic data, up to the point at which parameters have been extracted and are available for statistical processing. The topics to be covered are divided into two groups. The first group involves
Next 10 →
Results 1 - 10 of 129
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