Sciweavers

585 search results - page 92 / 117
» Better Abstractions for Timed Automata
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
14 years 9 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
JCP
2008
99views more  JCP 2008»
14 years 9 months ago
Scheduling Algorithm with Potential Behaviors
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
Jianhua Jiang, Huifang Ji, Gaochao Xu, Xiaohui Wei
TAP
2008
Springer
94views Hardware» more  TAP 2008»
14 years 9 months ago
Vacuity in Testing
Abstract. In recent years, we see a growing awareness to the importance of assessing the quality of specifications. In the context of model checking, this can be done by analyzing ...
Thomas Ball, Orna Kupferman
TKDE
2008
154views more  TKDE 2008»
14 years 9 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...
JUCS
2007
94views more  JUCS 2007»
14 years 9 months ago
Discovering the Semantics of User Keywords
Abstract: The technology in the field of digital media generates huge amounts of textual information every day, so mechanisms to retrieve relevant information are needed. Under th...
Raquel Trillo, Jorge Gracia, Mauricio Espinoza, Ed...