Sciweavers

100 search results - page 15 / 20
» A fast solver for linear systems with displacement structure
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
99
Voted
PROCEDIA
2010
103views more  PROCEDIA 2010»
14 years 4 months ago
The Deflated Relaxed Incomplete Cholesky CG method for use in a real-time ship simulator
Ship simulators are used for training purposes and therefore have to calculate realistic wave patterns around the moving ship in real time. We consider a wave model that is based ...
E. van't Wout, M. B. van Gijzen, A. Ditzel, Auke v...
74
Voted
SIAMJO
2000
74views more  SIAMJO 2000»
14 years 9 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
15 years 11 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
80
Voted
CP
2001
Springer
15 years 2 months ago
Solving Disjunctive Constraints for Interactive Graphical Applications
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
Kim Marriott, Peter Moulder, Peter J. Stuckey, Ala...