10414 search results - page 269 / 2083 » An efficient algorithm for Co-segmentation |
176
click to vote
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
170
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Many applications in wireless sensor networks rely on data from neighboring nodes. However, the effort for developing efficient solutions for sharing data in the neighborhood is of...
172
click to vote
CCR
2006
15 years 6 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
155
click to vote
ACL
2009
15 years 4 months ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
163
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...