11345 search results - page 1617 / 2269 » Foundations of Computer Science |
151
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
191
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
201
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
191
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
225
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...