Sciweavers

2212 search results - page 56 / 443
» Weighted control scheduling
Sort
View
DAWAK
2010
Springer
13 years 8 months ago
Frequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
Chuntao Jiang, Frans Coenen, Michele Zito
TON
2002
109views more  TON 2002»
13 years 7 months ago
Coordinated multihop scheduling: a framework for end-to-end services
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...
Chengzhi Li, Edward W. Knightly
ICDCSW
2008
IEEE
14 years 2 months ago
Fast Link Assessment in Wireless Mesh Networks by Using Non-Constant Weight Code
Abstract— The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the...
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu
GISCIENCE
2010
Springer
190views GIS» more  GISCIENCE 2010»
13 years 8 months ago
Semantic Referencing - Determining Context Weights for Similarity Measurement
Semantic similarity measurement is a key methodology in various domains ranging from cognitive science to geographic information retrieval on the Web. Meaningful notions of similar...
Krzysztof Janowicz, Benjamin Adams, Martin Raubal
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario