5100 search results - page 858 / 1020 » The Linear Complexity of a Graph |
172
click to vote
ICLP
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
161
click to vote
ISAAC
2007
Springer
16 years 14 days ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
146
click to vote
MDM
2007
Springer
16 years 14 days ago
2007
Springer
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
147
click to vote
MFCS
2007
Springer
16 years 14 days ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
198
click to vote
MLDM
2007
Springer
16 years 14 days ago
2007
Springer
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...