Sciweavers

5030 search results - page 642 / 1006
» cases 2007
Sort
View
CONCUR
2007
Springer
15 years 10 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
ICALP
2007
Springer
15 years 10 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 10 months ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
WCE
2007
15 years 8 months ago
An Implantable Retinal Stimulator Design for Long-term Animal Experiments
— this article reports on an electrical retinal stimulation system for use in long-term animal electrical stimulation experiments. The presented system consists of an implantable...
Jungai Zhou, Se Ik Park, J. M. Seo, Seung Woo Lee,...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 6 months ago
Probabilistic Analysis of Linear Programming Decoding
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...