Sciweavers

12 search results - page 2 / 3
» Handling of Numeric Ranges for Graph-Based Knowledge Discove...
Sort
View
P2PKM
2004
13 years 6 months ago
Ontology-based Service Discovery in P2P Networks
The ubiquitous computing vision is to make knowledge and services easily available in our everyday environments. A wide range of devices, applications and services can be intercon...
Daniel Elenius, Magnus Ingmarsson
SDM
2012
SIAM
305views Data Mining» more  SDM 2012»
11 years 7 months ago
Learning Hierarchical Relationships among Partially Ordered Objects with Heterogeneous Attributes and Links
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
Chi Wang, Jiawei Han, Qi Li, Xiang Li, Wen-Pin Lin...
AOSD
2007
ACM
13 years 8 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
BMCBI
2010
188views more  BMCBI 2010»
13 years 4 months ago
CDK-Taverna: an open workflow environment for cheminformatics
Background: Small molecules are of increasing interest for bioinformatics in areas such as metabolomics and drug discovery. The recent release of large open access chemistry datab...
Thomas Kuhn, Egon L. Willighagen, Achim Zielesny, ...
GLOBECOM
2008
IEEE
13 years 11 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...