4926 search results - page 459 / 986 » Two Graph Algorithms On an Associative Computing Model |
135
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
124
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
160
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
174
Voted
ICSM
2002
IEEE
15 years 9 months ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
133
click to vote
SMA
2006
ACM
15 years 10 months ago
2006
ACM
As compatible meshes play important roles in many computeraided design applications, we present a new approach for modelling compatible meshes. Our compatible mesh modelling metho...