Sciweavers

13603 search results - page 2711 / 2721
» On the Complexity of Computing Treelength
Sort
View
SIGARCH
2008
107views more  SIGARCH 2008»
13 years 9 months ago
A lightweight streaming layer for multicore execution
As multicore architectures gain widespread use, it becomes increasingly important to be able to harness their additional processing power to achieve higher performance. However, e...
David Zhang, Qiuyuan J. Li, Rodric Rabbah, Saman A...
IJET
2007
121views more  IJET 2007»
13 years 9 months ago
A Technology Based Program That Matches Enrichment Resources With Student Strengths
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
Joseph S. Renzulli, Sally M. Reis
IJON
2007
184views more  IJON 2007»
13 years 9 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
TCOM
2008
115views more  TCOM 2008»
13 years 9 months ago
Differentiated rate scheduling for the down-link of cellular systems
We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must sat...
Amir F. Dana, Masoud Sharif, Ali Vakili, Babak Has...
TCS
2008
13 years 9 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
« Prev « First page 2711 / 2721 Last » Next »