Sciweavers

6045 search results - page 901 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
STACS
2007
Springer
16 years 26 days ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
FCCM
2006
IEEE
111views VLSI» more  FCCM 2006»
16 years 24 days ago
Pipelined Mixed Precision Algorithms on FPGAs for Fast and Accurate PDE Solvers from Low Precision Components
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
Robert Strzodka, Dominik Göddeke
ICDCS
2006
IEEE
16 years 24 days ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
ACCV
2006
Springer
16 years 22 days ago
A Multiscale Co-linearity Statistic Based Approach to Robust Background Modeling
Background subtraction is an essential task in several static camera based computer vision systems. Background modeling is often challenged by spatio-temporal changes occurring due...
Prithwijit Guha, Dibyendu Palai, K. S. Venkatesh, ...
COMPGEOM
2006
ACM
16 years 21 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...