2107 search results - page 274 / 422 » Computing Small Search Numbers in Linear Time |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
ICSE
2003
IEEE-ACM
14 years 9 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
EWSN
2004
Springer
14 years 8 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
ISCAS
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we propose a semi-blind time domain equalizer (TEQ) design method that maximize SIR (signal-tointerference ratio) in frequency domain for VDSL systems. The proposed ...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...