4850 search results - page 210 / 970 » Approximate Data Structures with Applications |
178
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
147
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...
167
Voted
RSKT
2010
Springer
15 years 4 months ago
2010
Springer
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...
183
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
166
click to vote
ACSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
1 A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement...