9842 search results - page 1768 / 1969 » The Complexity of the Matching-Cut Problem |
130
click to vote
ISSTA
2009
ACM
15 years 10 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...
117
Voted
ITICSE
2009
ACM
15 years 10 months ago
2009
ACM
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signiï¬...
152
click to vote
MM
2009
ACM
15 years 10 months ago
2009
ACM
Finding a destination in unfamiliar environments of complex office building or shopping mall has been always bothering us in daily life. Fine-scale directional guidance, a combina...
107
click to vote
SIGECOM
2009
ACM
15 years 10 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. ...
141
Voted
BMEI
2008
IEEE
15 years 10 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...