Sciweavers

1945 search results - page 38 / 389
» Pursuit-Evasion in Models of Complex Networks
Sort
View
JMLR
2012
11 years 10 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
DATE
2010
IEEE
163views Hardware» more  DATE 2010»
14 years 10 days ago
Efficient High-Level modeling in the networking domain
-- Starting Electronic System Level (ESL) design flows with executable High-Level Models (HLMs) has the potential to sustainably improve productivity. However, writing good HLMs fo...
Christian Zebelein, Joachim Falk, Christian Haubel...
SIGUCCS
2003
ACM
14 years 1 months ago
Enforcing model network citizenship by remote administration
Higher education institutions have been striving to improve services and keep pace with new technologies. In a Higher education environment, the users utilize the available comput...
Prasun Gupta, Mahmoud Pegah
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 7 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 2 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng