2111 search results - page 103 / 423 » Understanding the Yarowsky Algorithm |
107
Voted
NIPS
2001
15 years 1 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
78
Voted
ALIFE
2006
15 years 19 days ago
2006
This study presents a new evolutionary network minimization (ENM) algorithm. Neurocontroller minimization is beneficial for finding small parsimonious networks that permit a better...
126
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
120
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
97
Voted
ESTIMEDIA
2009
Springer
15 years 7 months ago
2009
Springer
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...