Sciweavers

4894 search results - page 706 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
COMSIS
2007
167views more  COMSIS 2007»
13 years 8 months ago
Developing a New Color Model for Image Analysis and Processing
The theoretical outcomes and experimental results of new color model implemented in algorithms and software of image processing are presented in the paper. This model, as it will b...
Rashad J. Rasras, Ibrahiem M. M. El Emary, Dimitri...
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 8 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
IJWIN
2006
209views more  IJWIN 2006»
13 years 8 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
JCSS
2008
80views more  JCSS 2008»
13 years 8 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
CSDA
2007
128views more  CSDA 2007»
13 years 8 months ago
Regularized linear and kernel redundancy analysis
Redundancy analysis (RA) is a versatile technique used to predict multivariate criterion variables from multivariate predictor variables. The reduced-rank feature of RA captures r...
Yoshio Takane, Heungsun Hwang