Sciweavers

2957 search results - page 564 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
PLDI
2003
ACM
14 years 25 days 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 25 days 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 ...
SI3D
2003
ACM
14 years 25 days ago
Large haptic topographic maps: marsview and the proxy graph algorithm
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
Sean P. Walker, John Kenneth Salisbury Jr.
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
14 years 25 days ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
XMLSEC
2003
ACM
14 years 25 days ago
An access control framework for business processes for web services
Business Processes for Web Services are the new paradigm for the lightweight integration of business from different enterprises. Whereas the security and access control policies ...
Hristo Koshutanski, Fabio Massacci