Sciweavers

219 search results - page 44 / 44
» Modeling the Combinatorial Functions of Multiple Transcripti...
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
IMC
2006
ACM
14 years 1 months ago
Unexpected means of protocol inference
Network managers are inevitably called upon to associate network traffic with particular applications. Indeed, this operation is critical for a wide range of management functions...
Justin Ma, Kirill Levchenko, Christian Kreibich, S...
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 9 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
ECIR
2007
Springer
13 years 9 months ago
Combining Evidence for Relevance Criteria: A Framework and Experiments in Web Retrieval
Abstract. We present a framework that assesses relevance with respect to several relevance criteria, by combining the query-dependent and query-independent evidence indicating thes...
Theodora Tsikrika, Mounia Lalmas