Sciweavers

2887 search results - page 40 / 578
» Name Generation and Linearity
Sort
View
MCU
2004
129views Hardware» more  MCU 2004»
15 years 7 months ago
Solving 3CNF-SAT and HPP in Linear Time Using WWW
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
Florin Manea, Carlos Martín-Vide, Victor Mi...
CPC
2006
110views more  CPC 2006»
15 years 5 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
ICIP
2002
IEEE
16 years 7 months ago
JANIS: Just Another n-order Side-Informed Watermarking Scheme
This paper deals with some detection issues of watermark signals. We propose an easy way to implement an informed watermarking embedder whatever the detection function. This metho...
Teddy Furon, Benoit M. Macq, Neil J. Hurley, Gueno...
EPIA
2009
Springer
16 years 10 days ago
Colored Nonograms: An Integer Linear Programming Approach
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
Luís Mingote, Francisco Azevedo
ICC
2008
IEEE
115views Communications» more  ICC 2008»
16 years 6 days ago
Near-Capacity Irregular Precoded Linear Dispersion Codes
—In this treatise, we propose a novel serial concatenated RSC-coded Irregular Precoded Linear Dispersion Codes (IR-PLDC), which is capable of operating near MIMO channel’s capa...
Nan Wu, Lajos Hanzo