Sciweavers

78 search results - page 9 / 16
» Heuristics for Internet Map Discovery
Sort
View
WWW
2007
ACM
14 years 8 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
DMIN
2008
190views Data Mining» more  DMIN 2008»
13 years 9 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
13 years 11 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
WOWMOM
2005
ACM
135views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
Service Discovery in Mobile Ad Hoc Networks: A Field Theoretic Approach
Service discovery in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Traditional solutions as used in the Internet are hen...
Vincent Lenders, Martin May, Bernhard Plattner
WWW
2007
ACM
14 years 8 months ago
Web mashup scripting language
The Web Mashup Scripting Language (WMSL) enables an enduser ("you") working from his browser, e.g. not needing any other infrastructure, to quickly write mashups that in...
Marwan Sabbouh, Jeff Higginson, Salim Semy, Danny ...