Sciweavers

2542 search results - page 388 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ATAL
2009
Springer
14 years 4 months ago
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
STACS
1999
Springer
14 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
IMAGING
2003
13 years 11 months ago
Spectral Color Processing Using an Interim Connection Space
The use of an Interim Connection Space (ICS) is proposed as a means for extending the concept of device independent color management to support spectral imaging. Color management,...
Mitchell R. Rosen, Noboru Ohta
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 11 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
SIAMSC
2008
131views more  SIAMSC 2008»
13 years 10 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner