Sciweavers

3082 search results - page 414 / 617
» New Bounds for the Controller Problem
Sort
View
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 27 days ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 10 months ago
Gigapixel Binary Sensing: Image Acquisition Using Oversampled One-Bit Poisson Statistics
We study a new gigapixel image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measur...
Feng Yang, Yue M. Lu, Luciano Sbaiz, Martin Vetter...
ICASSP
2011
IEEE
14 years 10 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
GLOBECOM
2010
IEEE
15 years 3 months ago
Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks
Abstract--Today's file sharing networks are creating potential security problems to enterprise networks, i.e., the leakage of confidential documents. In order to prevent such ...
Junchen Jiang, Yi Tang, Bin Liu, Yang Xu, Xiaofei ...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 9 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay