Sciweavers

725 search results - page 37 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 2 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
CASES
2006
ACM
15 years 3 months ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
15 years 4 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
85
Voted
DCC
2011
IEEE
14 years 4 months ago
Distributed Quantization of Order Statistics with Applications to CSI Feedback
Feedback of channel state information (CSI) in wireless systems is essential in order to exploit multi-user diversity and achieve the highest possible performace. When each spatia...
Matthew Pugh, Bhaskar D. Rao