Sciweavers

343 search results - page 11 / 69
» Directions for Research in Approximate System Analysis
Sort
View
SPAA
2010
ACM
14 years 11 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ICIS
2004
13 years 9 months ago
Desperately Seeking Systems Thinking in the Information Systems Discipline
Although called systems, information systems in organizations are often viewed as tools that "users" use. IS success is often gauged as though it were about acceptance a...
Steven Alter
VTC
2006
IEEE
141views Communications» more  VTC 2006»
14 years 1 months ago
Closed-Form BER Analysis for Antenna Selection Using Orthogonal Space-Time Block Codes
— Despite significant research efforts, closed-form bit error rate (BER) expressions for multiple-input multiple-output (MIMO) systems employing transmit antenna selection and o...
Saeed Kaviani, Chintha Tellambura
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
ISMB
1997
13 years 9 months ago
SEALS: A System for Easy Analysis of Lots of Sequences
We present a system of programs designed to facilitate sequence analysis projects involving large amounts of data. SEALS (System for Easy Analysis of Lots of Sequences) is a logic...
D. Roland Walker, Eugene V. Koonin