2899 search results - page 98 / 580 » Dynamic Trees in Practice |
ICCSA
2007
Springer
14 years 3 months ago
2007
Springer
In our recent study, we have presented an approach for tracing illegal users in content distribution networks using watermarking and fingerprinting techniques [1][2]. In this paper...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
PDCAT
2005
Springer
14 years 2 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
ICISC
2003
13 years 10 months ago
2003
Binary tree encryption (BTE), a relaxation of hierarchical identity-based encryption (HIBE), has recently emerged as a useful and intriguing primitive. On the one hand, the defini...
JDA
2007
13 years 8 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...