6575 search results - page 741 / 1315 » Specializing visualization algorithms |
155
click to vote
COLT
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
192
Voted
EMSOFT
2005
Springer
16 years 7 days ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
173
click to vote
ISAAC
2005
Springer
16 years 7 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
164
click to vote
WADS
2005
Springer
16 years 6 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
176
click to vote
COLT
2004
Springer
16 years 3 days ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...