8695 search results - page 1431 / 1739 » Making the Complex Simple |
159
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
180
click to vote
ICDCS
2012
IEEE
13 years 6 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
176
click to vote
SIAMCOMP
2012
13 years 6 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
134
Voted
OSDI
2004
ACM
16 years 4 months ago
2004
ACM
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
171
Voted
BMCBI
2007
15 years 4 months ago
2007
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...