Sciweavers

1782 search results - page 67 / 357
» Learning in Parallel Universes
Sort
View
SIGMOD
2003
ACM
133views Database» more  SIGMOD 2003»
15 years 10 months ago
Learning about data integration challenges from day one
I describe the format of the new version of an introductory database course that I taught at the University of Washington in Winter, 2003. The key idea underlying the course is to...
Alon Y. Halevy
IJON
2008
118views more  IJON 2008»
14 years 9 months ago
Incremental extreme learning machine with fully complex hidden nodes
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
Guang-Bin Huang, Ming-Bin Li, Lei Chen, Chee Kheon...
SAS
2000
Springer
15 years 1 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
IJFCS
2007
100views more  IJFCS 2007»
14 years 9 months ago
On the Power of Deterministic and Sequential Communicating P Systems
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in...
Ludek Cienciala, Lucie Ciencialová, Pierlui...
ISCAPDCS
2001
14 years 11 months ago
A Study of Parallel Monitoring Algorithm in ATM Network Admission Control
Admission control strategies play an important role in congestion control and in guaranteeing the quality of service in Asynchronous Transfer Mode (ATM) networks. Three categories...
Mansoor Alam, Carl Weisfelder, Min Song