10414 search results - page 185 / 2083 » An efficient algorithm for Co-segmentation |
155
click to vote
CGO
2003
IEEE
15 years 10 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
266
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
171
click to vote
INFOCOM
2006
IEEE
16 years 12 days ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
144
click to vote
COR
2008
15 years 6 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
193
click to vote
DEXA
2005
Springer
15 years 12 months ago
2005
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...