Sciweavers

15 search results - page 2 / 3
» Smaller core-sets for balls
Sort
View
INFOCOM
2008
IEEE
13 years 11 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
COGSCI
2004
90views more  COGSCI 2004»
13 years 4 months ago
Moving words: dynamic representations in language comprehension
Eighty-two participants listened to sentences and then judged whether two sequentially presented visual objects were the same. On critical trials, participants heard a sentence de...
Rolf A. Zwaan, Carol J. Madden, Richard H. Yaxley,...
CHI
2005
ACM
14 years 5 months ago
Effects of tiled high-resolution display on basic visualization and navigation tasks
Large high-resolution screens are becoming increasingly available and less expensive. This creates potential advantages for data visualization in that more dense data and fine det...
Robert Ball, Chris North
MICCAI
2000
Springer
13 years 8 months ago
An Augmentation System for Fine Manipulation
Augmented surgical manipulation tasks can be viewed as a sequence of smaller, steps driven primarily by the surgeon's input. These steps can be abstracted as controlled intera...
Rajesh Kumar 0001, Gregory D. Hager, Aaron C. Barn...
DAM
2007
177views more  DAM 2007»
13 years 4 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim