8825 search results - page 92 / 1765 » All for one or one for all |
105
click to vote
FAW
2009
Springer
15 years 7 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
129
click to vote
SEMCO
2008
IEEE
15 years 7 months ago
2008
IEEE
Where are all the semantic Web services today? In this paper, we report on quantitative results of searching the surface Web and the prominent citeseer archive as one element of t...
116
click to vote
ICSM
2007
IEEE
15 years 7 months ago
2007
IEEE
In this demonstration we present an Eclipse plug-in that identifies Feature Envy bad smells in Java projects and resolves them by applying the appropriate Move Method refactorings...
115
click to vote
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
115
click to vote
EEE
2005
IEEE
15 years 6 months ago
2005
IEEE
Service oriented architectures facilitate loosely coupled collaborations, which are established in a decentralized way. One challenge for such collaborations is to guarantee consi...