5595 search results - page 458 / 1119 » Approximation Algorithms for Clustering Problems |
245
click to vote
TNN
2010
15 years 2 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
184
click to vote
CHARME
1997
Springer
15 years 11 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
237
click to vote
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
205
click to vote
IEEEPACT
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper presents an energy management policy for reconfigurable clusters running a multi-tier application, exploiting DVS together with multiple sleep states. We develop a the...
229
click to vote
KAIS
2011
15 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...