Sciweavers

28888 search results - page 96 / 5778
» Computability and complexity in analysis
Sort
View
TLCA
2007
Springer
14 years 2 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
CLUSTER
2004
IEEE
13 years 11 months ago
Towards informatic analysis of Syslogs
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
John Stearley
ACSC
2006
IEEE
14 years 2 months ago
Trust network analysis with subjective logic
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
Audun Jøsang, Ross Hayward, Simon Pope
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
14 years 2 months ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...
TSP
2011
141views more  TSP 2011»
13 years 2 months ago
Algorithms for Interpolation-Based QR Decomposition in MIMO-OFDM Systems
The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requ...
Davide Cescato, Helmut Bölcskei