9842 search results - page 337 / 1969 » The Complexity of the Matching-Cut Problem |
152
Voted
SSDBM
2007
IEEE
15 years 10 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
142
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These qu...
154
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
127
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
134
click to vote
ICIP
2006
IEEE
15 years 10 months ago
2006
IEEE
Rate control is a complicated problem in the H.264/AVC coding standard, extra computation is usually needed for the existing rate control schemes to estimate the complexity of fra...