1729 search results - page 239 / 346 » Bound Graph Polysemy |
168
click to vote
DM
2002
15 years 5 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
152
click to vote
NAACL
2010
15 years 4 months ago
2010
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
164
Voted
RV
2010
Springer
15 years 4 months ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
192
click to vote
DCG
2011
15 years 1 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
201
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...