169 search results - page 31 / 34 » Modeling Complex Flows for Worst-Case Execution Time Analysi... |
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
ITNG
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
EMSOFT
2009
Springer
13 years 11 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...