7930 search results - page 114 / 1586 » Greedy in Approximation Algorithms |
170
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
205
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
197
click to vote
EGH
2010
Springer
15 years 4 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
202
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
190
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— High-speed wireless communication technology (e.g. WiMAX) makes it feasible and cost-effective to build wireless back-hauls for Internet access. Compared to wired count...