Sciweavers

811 search results - page 56 / 163
» Avoiding Approximate Squares
Sort
View
PODC
2009
ACM
14 years 8 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
13 years 11 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
TIT
1998
99views more  TIT 1998»
13 years 7 months ago
Information-Theoretic Image Formation
—The emergent role of information theory in image formation is surveyed. Unlike the subject of information-theoretic communication theory, information-theoretic imaging is far fr...
Joseph A. O'Sullivan, Richard E. Blahut, Donald L....
ECCV
2002
Springer
14 years 8 months ago
Using Robust Estimation Algorithms for Tracking Explicit Curves
The context of this work is lateral vehicle control using a camera as a sensor. A natural tool for controlling a vehicle is recursive filtering. The well-known Kalman fil...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
ICML
2009
IEEE
14 years 8 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...