113 search results - page 19 / 23 » When can a graph form an orthogonal polyhedron |
BMCBI
2005
13 years 7 months ago
2005
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
COMPGEOM
2004
ACM
14 years 23 days ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
VLSISP
2008
13 years 7 months ago
2008
Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded ...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...