Sciweavers

507 search results - page 52 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 26 days ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
ICVGIP
2004
13 years 9 months ago
Geometric Structure Computation from Conics
This paper presents several results on images of various configurations of conics. We extract information about the plane from single and multiple views of known and unknown conic...
Pawan Kumar Mudigonda, C. V. Jawahar, P. J. Naraya...
WINE
2009
Springer
147views Economy» more  WINE 2009»
14 years 9 days ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
ICPPW
2007
IEEE
14 years 2 months ago
Power Management of Multicore Multiple Voltage Embedded Systems by Task Scheduling
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
Gang Qu