Sciweavers

83 search results - page 13 / 17
» Two techniques for fast computation of constrained shortest ...
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 8 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
CG
2005
Springer
13 years 7 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja
WSC
2004
13 years 8 months ago
A Case Study in Meta-Simulation Design and Performance Analysis for Large-Scale Networks
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...
CHI
2007
ACM
14 years 7 months ago
Demonstrating the viability of automatically generated user interfaces
We conducted two studies that demonstrate automatically generated interfaces can be more usable than interfaces created by human designers. The first study shows that users of aut...
Jeffrey Nichols, Duen Horng Chau, Brad A. Myers
IUI
2009
ACM
14 years 4 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock