Sciweavers

COCO
2001
Springer
101views Algorithms» more  COCO 2001»
14 years 4 months ago
Resolution Complexity of Independent Sets in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
14 years 4 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
AAECC
2001
Springer
95views Algorithms» more  AAECC 2001»
14 years 4 months ago
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation
Abstract. Cyclotomic constructions are given for several infinite families of even length binary sequences which have low negaperiodic autocorrelation. It appears that two of the ...
Matthew G. Parker
AAECC
2001
Springer
104views Algorithms» more  AAECC 2001»
14 years 4 months ago
On Senary Simplex Codes
This paper studies senary simplex codes of type α and two punctured versions of these codes (type β and γ). Self-orthogonality, torsion codes, weight distribution and weight hie...
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
14 years 4 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
AAECC
2001
Springer
117views Algorithms» more  AAECC 2001»
14 years 4 months ago
An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products
V. Álvarez, J. A. Armario, M. D. Frau, P. R...
SARA
2009
Springer
14 years 4 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
MFCS
2009
Springer
14 years 4 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 4 months ago
BBOB-benchmarking two variants of the line-search algorithm
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were...
Petr Posik
PODC
2009
ACM
14 years 4 months ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu