Sciweavers

1740 search results - page 34 / 348
» Minimal structures for stories
Sort
View
JSAC
2011
83views more  JSAC 2011»
13 years 27 days ago
Trading Rate for Balanced Queue Lengths for Network Delay Minimization
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...
Jing Yang, Sennur Ulukus
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 10 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
AGENTS
2001
Springer
14 years 2 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
ISMB
1993
13 years 11 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
ICSE
2009
IEEE-ACM
14 years 10 months ago
The secret life of bugs: Going past the errors and omissions in software repositories
Every bug has a story behind it. The people that discover and resolve it need to coordinate, to get information from documents, tools, or other people, and to navigate through iss...
Jorge Aranda, Gina Venolia