Sciweavers

942 search results - page 170 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
DAC
2009
ACM
14 years 2 months ago
A computing origami: folding streams in FPGAs
Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has a...
Andrei Hagiescu, Weng-Fai Wong, David F. Bacon, Ro...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 1 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ICPR
2000
IEEE
14 years 1 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
CSCWD
2008
Springer
13 years 11 months ago
Task partition for function tree according to innovative functional reasoning
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
Yiming Tang, Xiaoping Liu
KRDB
2003
111views Database» more  KRDB 2003»
13 years 11 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis