Sciweavers

2111 search results - page 392 / 423
» Understanding the Yarowsky Algorithm
Sort
View
SIGCSE
2010
ACM
175views Education» more  SIGCSE 2010»
15 years 5 months ago
MPCT: media propelled computational thinking
Media-Propelled Computational Thinking (MPCT – pronounced impact) is a course designed to introduce programming in the context of engaging problems in media computation, math, a...
Eric Andrew Freudenthal, Mary K. Roy, Alexandria N...
FOCS
2002
IEEE
15 years 5 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
108
Voted
SIGMOD
2009
ACM
165views Database» more  SIGMOD 2009»
15 years 5 months ago
Query by output
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in t...
Quoc Trung Tran, Chee-Yong Chan, Srinivasan Partha...
107
Voted
GECCO
2009
Springer
15 years 5 months ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
15 years 5 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...