535 search results - page 27 / 107 » Insertion and Expansion Operations for |
MICCAI
2004
Springer
16 years 20 days ago
2004
Springer
Early removal of polyps has proven to decrease the incidence of colon cancer. We aim to increase the sensitivity of the screening by automatic detection of polyps. It requires accu...
EDOC
2006
IEEE
15 years 5 months ago
2006
IEEE
At present, with the expansion of information technologies at the industry, it is vital to implant proactive, self-managed systems that ensure continuous operation and, therefore,...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
112
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
STACS
1997
Springer
15 years 3 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...