Sciweavers

COLT
2008
Springer
13 years 5 months ago
The True Sample Complexity of Active Learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 5 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 5 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
STOC
1991
ACM
127views Algorithms» more  STOC 1991»
13 years 7 months ago
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
Howard J. Karloff, Yuval Rabani, Yiftach Ravid
ICCAD
1995
IEEE
88views Hardware» more  ICCAD 1995»
13 years 7 months ago
Estimation and bounding of energy consumption in burst-mode control circuits
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...
Peter A. Beerel, Kenneth Y. Yun, Steven M. Nowick,...
GD
2000
Springer
13 years 7 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
AAECC
2003
Springer
104views Algorithms» more  AAECC 2003»
13 years 7 months ago
Interpolation of the Elliptic Curve Diffie-Hellman Mapping
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
Tanja Lange, Arne Winterhof
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
13 years 7 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
COCOON
2006
Springer
13 years 7 months ago
Improved On-Line Broadcast Scheduling with Deadlines
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, F...
CIE
2006
Springer
13 years 7 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek