Sciweavers

2520 search results - page 476 / 504
» The complexity of approximating entropy
Sort
View
VMCAI
2004
Springer
14 years 3 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
INFOCOM
2003
IEEE
14 years 3 months ago
Uplink Scheduling in CDMA Packet-Data Systems
Abstract—Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the curre...
Krishnan Kumaran, Lijun Qian
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 2 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
PLDI
2003
ACM
14 years 2 months ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
14 years 2 months ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...