Sciweavers

4934 search results - page 283 / 987
» complexity 2008
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
15 years 8 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
TIP
2002
114views more  TIP 2002»
15 years 6 months ago
New architecture for dynamic frame-skipping transcoder
Abstract--Transcoding is a key technique for reducing the bitrate of a previously compressed video signal. A high transcoding ratio may result in an unacceptable picture quality wh...
Kai-Tat Fung, Yui-Lam Chan, Wan-Chi Siu
ICMLA
2008
15 years 8 months ago
Comprehensible Models for Predicting Molecular Interaction with Heart-Regulating Genes
When using machine learning for in silico modeling, the goal is normally to obtain highly accurate predictive models. Often, however, models should also bring insights into intere...
Cecilia Sönströd, Ulf Johansson, Ulf Nor...
DCG
2008
93views more  DCG 2008»
15 years 6 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
IANDC
2008
122views more  IANDC 2008»
15 years 6 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza