4744 search results - page 335 / 949 » Connected Computing |
137
Voted
SIAMCOMP
2008
15 years 4 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
132
Voted
DCG
2010
14 years 11 months ago
2010
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
150
click to vote
JMLR
2010
14 years 11 months ago
2010
This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by "sparse" matrices. Taking advantage of the c...
151
click to vote
ACCV
1998
Springer
15 years 8 months ago
1998
Springer
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
111
click to vote
ECEASST
2008
15 years 4 months ago
2008
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...