Sciweavers

627 search results - page 87 / 126
» Efficient On-the-Fly Algorithms for the Analysis of Timed Ga...
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 4 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
CIKM
2005
Springer
14 years 28 days ago
Generating better concept hierarchies using automatic document classification
This paper presents a hybrid concept hierarchy development technique for web returned documents retrieved by a meta-search engine. The aim of the technique is to separate the init...
Razvan Stefan Bot, Yi-fang Brook Wu, Xin Chen, Qua...
DAC
2009
ACM
13 years 11 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
13 years 11 months ago
Improving the performance of active set based Model Predictive Controls by dataflow methods
Abstract-- Dataflow representations of Digital Signal Processing (DSP) software have been developing since the 1980's. They have proven to be useful in identifying bottlenecks...
Ruirui Gu, Shuvra S. Bhattacharyya, William S. Lev...
COLT
2008
Springer
13 years 9 months ago
Learning Coordinate Gradients with Multi-Task Kernels
Coordinate gradient learning is motivated by the problem of variable selection and determining variable covariation. In this paper we propose a novel unifying framework for coordi...
Yiming Ying, Colin Campbell