Sciweavers

1092 search results - page 166 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
ICC
2008
IEEE
163views Communications» more  ICC 2008»
16 years 22 days ago
Network Coding Aware Dynamic Subcarrier Assignment in OFDMA Wireless Networks
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
Xinyu Zhang, Baochun Li
ICDT
2007
ACM
126views Database» more  ICDT 2007»
16 years 13 days ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
GD
2005
Springer
15 years 11 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
WABI
2005
Springer
15 years 11 months ago
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. C...
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
15 years 11 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking