Sciweavers

2060 search results - page 412 / 412
» What, where and who
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 4 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
AAAI
2007
13 years 7 months ago
Learning by Reading: A Prototype System, Performance Baseline and Lessons Learned
A traditional goal of Artificial Intelligence research has been a system that can read unrestricted natural language texts on a given topic, build a model of that topic and reason...
Ken Barker, Bhalchandra Agashe, Shaw Yi Chaw, Jame...
WSC
1997
13 years 6 months ago
A Framework for the Simulation Experimentation Process
Modeling and simulation of very large systems introduces a number of issues that are not seen in the modeling of simpler systems. These arise because the resource requirements for...
Thomas C. Fall
JCSS
2008
120views more  JCSS 2008»
13 years 4 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 4 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell