109 search results - page 11 / 22 » Computing the betti numbers of arrangements |
TVLSI
2008
13 years 8 months ago
2008
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
A new quality metric, called area, is introduced for schedules that execute dags, i.e., computations having intertask dependencies. Motivated by the temporal unpredictability enco...
GD
2004
Springer
14 years 2 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
COMPGEOM
2000
ACM
14 years 1 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
ISMB
2000
13 years 10 months ago
2000
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...