Sciweavers

2111 search results - page 222 / 423
» Understanding the Yarowsky Algorithm
Sort
View
FOCS
2006
IEEE
16 years 19 days ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
PODC
2005
ACM
16 years 4 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 7 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
BMCBI
2010
143views more  BMCBI 2010»
15 years 6 months ago
Evaluation of methods for detection of fluorescence labeled subcellular objects in microscope images
Background: Several algorithms have been proposed for detecting fluorescently labeled subcellular objects in microscope images. Many of these algorithms have been designed for spe...
Pekka Ruusuvuori, Tarmo Äijö, Sharif Cho...
BMCBI
2007
164views more  BMCBI 2007»
15 years 6 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason