6562 search results - page 15 / 1313 » Noetherianity and Combination Problems |
JMLR
2010
13 years 4 months ago
2010
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
TSC
2010
13 years 4 months ago
2010
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
SAC
2011
ACM
13 years 17 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
NETWORKING
2011
13 years 18 days ago
2011
Abstract. Sensing mechanisms that estimate the occupancy of wireless spectrum are crucial to the success of approaches based on Dynamic Spectrum Access. In this paper, we present k...