Sciweavers

2239 search results - page 52 / 448
» Computing with abstract matrix structures
Sort
View
CI
2005
99views more  CI 2005»
14 years 11 months ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
Fei Xia, Martha Palmer, K. Vijay-Shanker
ENTCS
2008
120views more  ENTCS 2008»
14 years 12 months ago
Towards a Quantum Calculus: (Work in Progress, Extended Abstract)
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
Philippe Jorrand, Simon Perdrix
CG
2011
Springer
14 years 6 months ago
Exoskeleton: Curve network abstraction for 3D shapes
TON: Curve Network Abstraction for 3D Shapes Fernando de Goesa,∗ , Siome Goldensteinb , Mathieu Desbruna , Luiz Velhoc aCalifornia Institute of Technology, Pasadena, CA 91125, US...
Fernando de Goes, Siome Goldenstein, Mathieu Desbr...
ISMB
2000
15 years 1 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
ICPR
2004
IEEE
16 years 27 days ago
Galilean-Diagonalized Spatio-Temporal Interest Operators
Abstract. This paper presents a set of image operators for detecting regions in space-time where interesting events occur. To define such regions of interest, we compute a spatio-t...
Amir Akbarzadeh, Ivan Laptev, Tony Lindeberg