Sciweavers

1403 search results - page 247 / 281
» Set cover algorithms for very large datasets
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
AIRWEB
2008
Springer
13 years 10 months ago
The anti-social tagger: detecting spam in social bookmarking systems
The annotation of web sites in social bookmarking systems has become a popular way to manage and find information on the web. The community structure of such systems attracts spam...
Beate Krause, Christoph Schmitz, Andreas Hotho, Ge...
BMCBI
2010
136views more  BMCBI 2010»
13 years 8 months ago
SCPS: a fast implementation of a spectral method for detecting protein families on a genome-wide scale
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
Tamás Nepusz, Rajkumar Sasidharan, Alberto ...
GPEM
2008
128views more  GPEM 2008»
13 years 8 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
WWW
2011
ACM
13 years 3 months ago
Filtering microblogging messages for social TV
Social TV was named one of the ten most important emerging technologies in 2010 by the MIT Technology Review. Manufacturers of set-top boxes and televisions have recently started ...
Ovidiu Dan, Junlan Feng, Brian D. Davison