Sciweavers

503 search results - page 52 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
VTC
2006
IEEE
112views Communications» more  VTC 2006»
15 years 9 months ago
Adaptive Resource Allocation Based on Channel Information in Multihop OFDM Systems
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
ChiSung Bae, Dong-Ho Cho
151
Voted
RANDOM
1998
Springer
15 years 7 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
154
Voted
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 7 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
127
Voted
ALGORITHMICA
2004
84views more  ALGORITHMICA 2004»
15 years 3 months ago
Computing Diameter in the Streaming and Sliding-Window Models
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004
137
Voted
RECOMB
2005
Springer
16 years 3 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal