826 search results - page 130 / 166 » Designing for families |
DAM
2008
14 years 9 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
EOR
2008
14 years 9 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
DATAMINE
2006
14 years 9 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
IJWIS
2006
14 years 9 months ago
2006
Abstract-- The capabilities of embedded devices such as smartphones are steadily increasing and provide the great flexibility of data access and collaboration while being mobile. F...