Sciweavers

2031 search results - page 269 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
DEBS
2008
ACM
14 years 11 months ago
Extending Siena to support more expressive and flexible subscriptions
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
John Keeney, Dominik Roblek, Dominic Jones, David ...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
14 years 11 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
ICAI
2008
14 years 11 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen
IMAMS
2007
245views Mathematics» more  IMAMS 2007»
14 years 11 months ago
Discrete Surface Ricci Flow: Theory and Applications
Conformal geometry is in the core of pure mathematics. Conformal structure is more flexible than Riemaniann metric but more rigid than topology. Conformal geometric methods have p...
Miao Jin, Junho Kim, Xianfeng David Gu
MASCOTS
2007
14 years 11 months ago
Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit ...