Sciweavers

1047 search results - page 81 / 210
» Learning the required number of agents for complex tasks
Sort
View
EJC
2010
13 years 2 months ago
Inferencing in Database Semantics
As a computational model of natural language communication, Database Semantics1 (DBS) includes a hearer mode and a speaker mode. For the content to be mapped into language expressi...
Roland Hausser
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 8 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 21 days ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
BMCBI
2010
162views more  BMCBI 2010»
13 years 8 months ago
Moara: a Java library for extracting and normalizing gene and protein mentions
Background: Gene/protein recognition and normalization are important preliminary steps for many biological text mining tasks, such as information retrieval, protein-protein intera...
Mariana L. Neves, José María Carazo,...
CVPR
2008
IEEE
14 years 10 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona