Sciweavers

1322 search results - page 229 / 265
» Parameterized counting problems
Sort
View
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
14 years 3 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna
ICALP
2003
Springer
14 years 3 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
SIGMETRICS
1998
ACM
14 years 2 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan
GBRPR
2007
Springer
14 years 1 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal
ICFP
2010
ACM
13 years 11 months ago
Matching lenses: alignment and view update
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
Davi M. J. Barbosa, Julien Cretin, Nate Foster, Mi...