Sciweavers

19866 search results - page 410 / 3974
» Computing all factorizations in ***
Sort
View
PRL
1998
81views more  PRL 1998»
15 years 6 months ago
Lie generators for computing steerable functions
We present a computational, group-theoretic approach to steerable functions. The approach is group-theoretic in that the treatment involves continuous transformation groups for wh...
Patrick C. Teo, Yacov Hel-Or
TCS
2010
15 years 5 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
TCS
2011
15 years 1 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...

Publication
1286views
17 years 5 months ago
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitativel...
R. Jain, D. Chiu, and W. Hawe
CAV
2009
Springer
132views Hardware» more  CAV 2009»
16 years 7 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas