661 search results - page 51 / 133 » Levels of a scale-free tree |
166
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
In this paper a fully automatic system for embedding visually recognizable watermark patterns to video objects is proposed. The architecture consists of 3 main modules. During the...
158
click to vote
ICML
1999
IEEE
16 years 6 months ago
1999
IEEE
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
156
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
176
click to vote
IPPS
2007
IEEE
16 years 5 days ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
153
click to vote
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper sketches the design, and presents a scalability analysis and evaluation of NLS, a scalable naming and location service. NLS resolves textual names to the nearest of a s...