Sciweavers

7380 search results - page 258 / 1476
» time 2008
Sort
View
DEBU
2008
156views more  DEBU 2008»
15 years 6 months ago
Towards Automatic Test Database Generation
Testing is one of the most expensive and time consuming activities in the software development cycle. In order to reduce the cost and the time to market, many approaches to automa...
Carsten Binnig, Donald Kossmann, Eric Lo
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
15 years 6 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
IPL
2007
130views more  IPL 2007»
15 years 6 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
IPL
2007
89views more  IPL 2007»
15 years 6 months ago
On the longest path algorithm for reconstructing trees from distance matrices
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
Lev Reyzin, Nikhil Srivastava
TIT
2008
54views more  TIT 2008»
15 years 6 months ago
Exponential Diversity Achieving Spatio-Temporal Power Allocation Scheme for Fading Channels
In this paper, we analyze optimal (in space and time) adaptive power transmission policies for fading channels when the channel-state information (CSI) at the transmitter (CSIT) an...
Vinod Sharma, Karumbu Premkumar, Raghava N. Swamy