2911 search results - page 479 / 583 » A Logic of Graph Constraints |
110
Voted
CN
1999
15 years 9 days ago
1999
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
108
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
141
Voted
TVCG
2011
14 years 7 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
95
Voted
SIAMJO
2010
14 years 7 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
127
click to vote
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...