Sciweavers

1679 search results - page 328 / 336
» Strong order equivalence
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 8 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
TASE
2008
IEEE
13 years 8 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
BC
2005
84views more  BC 2005»
13 years 8 months ago
A computational model of monkey cortical grating cells
Grating cells were discovered in the V1 and V2 areas of the monkey visual cortex by von der Heydt et al. (1992). These cells responded vigorously to grating patterns of appropriate...
Tino Lourens, Emilia I. Barakova, Hiroshi G. Okuno...
TIP
2008
107views more  TIP 2008»
13 years 8 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
BMCBI
2005
109views more  BMCBI 2005»
13 years 8 months ago
Automation of gene assignments to metabolic pathways using high-throughput expression data
Background: Accurate assignment of genes to pathways is essential in order to understand the functional role of genes and to map the existing pathways in a given genome. Existing ...
Liviu Popescu, Golan Yona