740 search results - page 129 / 148 » Lower bounds for Buchsbaum* complexes |
140
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
148
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
200
click to vote
SCOPES
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
190
click to vote
DBPL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
186
click to vote
IWQOS
2001
Springer
15 years 10 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...