Sciweavers

CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 7 months ago
Resource Allocation with Subcarrier Pairing in OFDMA Two-Way Relay Networks
Abstract—This study considers an orthogonal frequencydivision multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with...
Hao Zhang, Yuan Liu, Meixia Tao
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
13 years 2 months ago
Apples and oranges: a comparison of RDF benchmarks and real RDF datasets
The widespread adoption of the Resource Description Framework (RDF) for the representation of both open web and enterprise data is the driving force behind the increasing research...
Songyun Duan, Anastasios Kementsietsidis, Kavitha ...
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 11 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
EOR
2006
104views more  EOR 2006»
13 years 11 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
VLDB
1997
ACM
142views Database» more  VLDB 1997»
14 years 3 months ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 6 months ago
Integer Programming: Optimization and Evaluation Are Equivalent
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
ECCV
2008
Springer
15 years 1 months ago
Light-Efficient Photography
We consider the problem of imaging a scene with a given depth of field at a given exposure level in the shortest amount of time possible. We show that by (1) collecting a sequence ...
Samuel W. Hasinoff, Kiriakos N. Kutulakos