Sciweavers

3172 search results - page 58 / 635
» New developments of the Z-EDM algorithm
Sort
View
130
Voted
FOCM
2010
140views more  FOCM 2010»
15 years 2 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
136
Voted
PVLDB
2008
108views more  PVLDB 2008»
15 years 3 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
100
Voted
CEC
2005
IEEE
15 years 9 months ago
Complementary selection and variation for an efficient multiobjective optimization of complex systems
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
Benoît Bagot, Hartmut Pohlheim
102
Voted
JAIR
2006
74views more  JAIR 2006»
15 years 3 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
149
Voted
TWC
2010
14 years 10 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim