Sciweavers

2835 search results - page 496 / 567
» Automatic Question Answering
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
INFOCOM
2009
IEEE
16 years 1 months ago
Keep Cache Replacement Simple in Peer-Assisted VoD Systems
—Peer-assisted Video-on-Demand (VoD) systems have not only received substantial recent research attention, but also been implemented and deployed with success in large-scale real...
Jiahua Wu, Baochun Li
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
16 years 1 months ago
Predicting the navigation performance of underwater vehicles
— In this paper we present a general framework for predicting the positioning uncertainty of underwater vehicles. We apply this framework to common examples from marine robotics:...
Brian Bingham
ISCA
2009
IEEE
152views Hardware» more  ISCA 2009»
16 years 1 months ago
Scaling the bandwidth wall: challenges in and avenues for CMP scaling
As transistor density continues to grow at an exponential rate in accordance to Moore’s law, the goal for many Chip Multi-Processor (CMP) systems is to scale the number of on-ch...
Brian M. Rogers, Anil Krishna, Gordon B. Bell, Ken...
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
16 years 1 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...