Sciweavers

1922 search results - page 296 / 385
» ie 2007
Sort
View
IPL
2007
111views more  IPL 2007»
14 years 9 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
IPL
2007
99views more  IPL 2007»
14 years 9 months ago
Approximation algorithms for minimizing segments in radiation therapy
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
Shuang Luan, Jared Saia, Maxwell Young
IPL
2007
113views more  IPL 2007»
14 years 9 months ago
Greedy online frequency allocation in cellular networks
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
IPL
2007
101views more  IPL 2007»
14 years 9 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
JAIR
2007
113views more  JAIR 2007»
14 years 9 months ago
Chain: A Dynamic Double Auction Framework for Matching Patient Agents
In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a res...
Jonathan Bredin, David C. Parkes, Quang Duong