5214 search results - page 330 / 1043 » The Online Specialization Problem |
169
Voted
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
168
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
116
click to vote
IJFCS
2007
15 years 6 months ago
2007
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
189
click to vote
IPM
2007
15 years 6 months ago
2007
This papers studies a special “small” information retrieval problem where user satisfaction only depends on the ordering of documents. We look for a retrieval performance meas...
195
click to vote
TSMC
2008
15 years 6 months ago
2008
Abstract--In this paper, a synchronization problem is investigated for an array of coupled complex discrete-time networks with the simultaneous presence of both the discrete and di...