3267 search results - page 408 / 654 » Generalized quasirandom graphs |
170
Voted
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
205
click to vote
MM
2009
ACM
16 years 1 months ago
2009
ACM
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
130
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
160
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
131
click to vote
IEEESCC
2008
IEEE
16 years 1 months ago
2008
IEEE
Software services are, just like any other software system, subject to permanent change. We argue that these changes should generally be transparent to service consumers. However,...