Sciweavers

49 search results - page 10 / 10
» A fast polynomial time algorithm for logistics network flows
Sort
View
EMSOFT
2009
Springer
13 years 11 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
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...
Marc Pouzet, Pascal Raymond
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 8 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICCD
2007
IEEE
183views Hardware» more  ICCD 2007»
14 years 4 months ago
Constraint satisfaction in incremental placement with application to performance optimization under power constraints
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
Huan Ren, Shantanu Dutt
ICMCS
2006
IEEE
159views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Image Vector Quantization Indices Recovery using Lagrange Interpolation
Vector quantization (VQ) is an efficient coding algorithm due to its fast decoding efficiency. Indices of VQ will be lost during the transmission because of the signal interferenc...
Yung-Gi Wu, Chia-Hao Wu