Sciweavers

10988 search results - page 305 / 2198
» Algorithmic Folding Complexity
Sort
View
ESA
2007
Springer
150views Algorithms» more  ESA 2007»
15 years 10 months ago
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
Amos Israeli, Dror Rawitz, Oran Sharon
ELPUB
2006
ACM
15 years 10 months ago
Text Parsing of a Complex Genre
A text parsing component designed to be part of a system that assists students in academic reading an writing is presented. The parser can automatically add a relational discourse...
Harald Lüngen, Maja Bärenfänger, Mi...
SIGIR
2005
ACM
15 years 10 months ago
Optimization strategies for complex queries
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
Trevor Strohman, Howard R. Turtle, W. Bruce Croft
VLDB
2005
ACM
140views Database» more  VLDB 2005»
15 years 10 months ago
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
Marios Hadjieleftheriou, George Kollios, Petko Bak...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 10 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...