9842 search results - page 1644 / 1969 » The Complexity of the Matching-Cut Problem |
163
click to vote
LCPC
2005
Springer
16 years 5 days ago
2005
Springer
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
178
click to vote
LCTRTS
2005
Springer
16 years 5 days ago
2005
Springer
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
199
click to vote
PAKDD
2005
ACM
16 years 5 days ago
2005
ACM
The usefulness of the results produced by data mining methods can be critically impaired by several factors such as (1) low quality of data, including errors due to contamination, ...
152
click to vote
PERVASIVE
2005
Springer
16 years 5 days ago
2005
Springer
The retail store environment is a challenging application area for Pervasive Computing technologies. It has demanding base conditions due to the number and complexity of the interd...
132
click to vote
STACS
2005
Springer
16 years 5 days ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...