Sciweavers

417 search results - page 58 / 84
» Orderings for Innermost Termination
Sort
View
IJIM
2008
124views more  IJIM 2008»
13 years 7 months ago
Personalization and User Profile Management
Personalization and effective user profile management will be critical to meet the individual users' needs and for achieving eInclusion and eAccessibility. This paper outlines...
Françoise Petersen, Giovanni Bartolomeo, Mi...
FUIN
2007
95views more  FUIN 2007»
13 years 7 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
VTC
2010
IEEE
175views Communications» more  VTC 2010»
13 years 6 months ago
Incremental Relaying with Imperfect Feedback in Wireless Cooperative Networks
—We present the ǫ-outage capacity in the low signal-to-noise ratio (SNR) regime of an incremental relaying network. The network consists of one source, one destination, and two ...
Tobias Renk, Holger Jaekel, Friedrich Jondral
ICMCS
2006
IEEE
139views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Carriage of 3D Audio-Visual Services by T-DMB
In this paper, we introduce our experience on the development of a three-dimensional audio-visual(3D AV) service system based on the terrestrial digital multimedia broadcasting (T...
Sukhee Cho, Namho Hur, Jinwoong Kim, Kugjin Yun, S...
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
14 years 4 days ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002