Sciweavers

1972 search results - page 241 / 395
» connection 2008
Sort
View
ADCM
2008
136views more  ADCM 2008»
15 years 6 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
AHSWN
2008
92views more  AHSWN 2008»
15 years 6 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 6 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
CCR
2008
94views more  CCR 2008»
15 years 6 months ago
ECHOS: edge capacity hosting overlays of nano data centers
In this paper we propose a radical solution to data hosting and delivery for the Internet of the future. The current data delivery architecture is "network centric", wit...
Nikolaos Laoutaris, Pablo Rodriguez, Laurent Masso...
CGF
2008
103views more  CGF 2008»
15 years 6 months ago
An Example-based Procedural System for Element Arrangement
We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based-on a local neighborh...
Takashi Ijiri, Radomír Mech, Takeo Igarashi...