12052 search results - page 462 / 2411 » computing 2010 |
166
click to vote
NETWORKS
2010
15 years 5 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
171
click to vote
ECCC
2006
15 years 6 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
156
click to vote
ENTCS
2007
15 years 6 months ago
2007
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
147
click to vote
ENTCS
2007
15 years 6 months ago
2007
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
191
click to vote
ECRA
2002
15 years 6 months ago
2002
Web Services will transform the web from a collection of information into a distributed computational device. In order to employ their full potential, appropriate description means...