Sciweavers

2239 search results - page 157 / 448
» Computing with abstract matrix structures
Sort
View
117
Voted
MCU
2004
59views Hardware» more  MCU 2004»
15 years 4 months ago
On the Complexity of Universal Programs
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
Alain Colmerauer
131
Voted
SIAMREV
2010
119views more  SIAMREV 2010»
14 years 10 months ago
From Functional Analysis to Iterative Methods
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
Robert C. Kirby

Lecture Notes
1759views
17 years 1 months ago
Single-Person and Multi-Person Decision Theory
These lecture notes cover several topics such as Abstract Preferences and Choices, A Choice Structure Approach to Consumer Demand, A Preference Based Approach to Consumer Demand P...
Max Stinchcombe
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
15 years 10 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
DCC
2006
IEEE
16 years 3 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...