Sciweavers

89222 search results - page 70 / 17845
» Which
Sort
View
HICSS
2008
IEEE
142views Biometrics» more  HICSS 2008»
13 years 9 months ago
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
Yamin Li, Shietung Peng, Wanming Chu
CAGD
2008
82views more  CAGD 2008»
13 years 9 months ago
On rationally supported surfaces
We analyze the class of surfaces which are equipped with rational support functions. Any rational support function can be decomposed into a symmetric (even) and an antisymmetric (...
Jens Gravesen, Bert Jüttler, Zbynek Sí...
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 9 months ago
Breaking the Legend: Maxmin Fairness notion is no longer effective
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for re...
Yaser Miaji, Suhaidi Hassan
EJC
2010
13 years 9 months ago
Geometric properties of Assur graphs
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
Brigitte Servatius, Offer Shai, Walter Whiteley
ENTCS
2008
103views more  ENTCS 2008»
13 years 9 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya