Sciweavers

762 search results - page 142 / 153
» Two Approaches to Merging Knowledge Bases
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
KDD
2012
ACM
190views Data Mining» more  KDD 2012»
12 years 7 days ago
Multi-label hypothesis reuse
Multi-label learning arises in many real-world tasks where an object is naturally associated with multiple concepts. It is well-accepted that, in order to achieve a good performan...
Sheng-Jun Huang, Yang Yu, Zhi-Hua Zhou
ADHOCNOW
2004
Springer
14 years 3 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
PODC
2004
ACM
14 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 3 months ago
Parameterized versus generative representations in structural design: an empirical comparison
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
Rafal Kicinger, Tomasz Arciszewski, Kenneth A. De ...