Sciweavers

1399 search results - page 191 / 280
» New Algorithms for k-Center and Extensions
Sort
View
JSS
2006
80views more  JSS 2006»
13 years 8 months ago
Polyhedral space generation and memory estimation from interface and memory models of real-time video systems
We present a tool and a methodology for estimating the memory storage requirement for synchronous real-time video processing systems. Typically, a designer will use the feedback i...
Benny Thörnberg, Qubo Hu, Martin Palkovic, Ma...
EOR
2007
90views more  EOR 2007»
13 years 8 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
TPDS
2008
125views more  TPDS 2008»
13 years 8 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
JSS
2007
120views more  JSS 2007»
13 years 8 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
TSMC
2002
110views more  TSMC 2002»
13 years 8 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek