1511 search results - page 95 / 303 » Randomness, lowness and degrees |
215
click to vote
BMCBI
2011
15 years 24 days ago
2011
Background: Automated, image based high-content screening is a fundamental tool for discovery in biological science. Modern robotic fluorescence microscopes are able to capture th...
171
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
290
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
164
click to vote
INFOCOM
2007
IEEE
16 years 18 days ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
163
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...