Sciweavers

1897 search results - page 208 / 380
» Sparse Additive Machine
Sort
View
COLT
2005
Springer
15 years 12 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 11 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
PLDI
2010
ACM
15 years 11 months ago
Z-rays: divide arrays and conquer speed and flexibility
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
Jennifer B. Sartor, Stephen M. Blackburn, Daniel F...
VISUALIZATION
1997
IEEE
15 years 10 months ago
Application-controlled demand paging for out-of-core visualization
In the area of scientific visualization, input data sets are often very large. In visualization of Computational Fluid Dynamics (CFD) in particular, input data sets today can surp...
Michael Cox, David Ellsworth
CIKM
2004
Springer
15 years 10 months ago
Taxonomy-driven computation of product recommendations
Recommender systems have been subject to an enormous rise in popularity and research interest over the last ten years. At the same time, very large taxonomies for product classifi...
Cai-Nicolas Ziegler, Georg Lausen, Lars Schmidt-Th...