Results 1  10
of
829
Regularized multitask learning
, 2004
"... This paper provides a foundation for multi–task learning using reproducing kernel Hilbert spaces of vector–valued functions. In this setting, the kernel is a matrix–valued function. Some explicit examples will be described which go beyond our earlier results in [7]. In particular, we characterize cl ..."
Abstract

Cited by 277 (2 self)
 Add to MetaCart
classes of matrix– valued kernels which are linear and are of the dot product or the translation invariant type. We discuss how these kernels can be used to model relations between the tasks and present linear multi–task learning algorithms. Finally, we present a novel proof of the representer theorem
Accurate Sum and Dot Product
 SIAM J. Sci. Comput
, 2005
"... Algorithms for summation and dot product of floating point numbers are presented which are fast in terms of measured computing time. We show that the computed results are as accurate as if computed in twice or Kfold working precision, K 3. For twice the working precision our algorithms for summa ..."
Abstract

Cited by 96 (15 self)
 Add to MetaCart
Algorithms for summation and dot product of floating point numbers are presented which are fast in terms of measured computing time. We show that the computed results are as accurate as if computed in twice or Kfold working precision, K 3. For twice the working precision our algorithms
Dot plots
 The American Statistician
, 1999
"... Dot plots represent individual observations in a batch of data with symbols, usually circular dots. They have been used for more than a hundred years to depict distributions in detail. Handdrawn examples show their authors ’ efforts to arrange symbols so that they are as near as possible to their pr ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
an algorithm that more accurately represents the dot plots cited in the literature.
Comparison of Accurate Dot Product Algorithms
, 1994
"... A recently proposed algorithm for the accurate computation of the dot product [Kob 94] has been implemented and modified in order to obtain the best possible algorithm for the Aquarels toolbox. It is compared with the other well known algorithms with respect to runtime and intermediate storage space ..."
Abstract
 Add to MetaCart
A recently proposed algorithm for the accurate computation of the dot product [Kob 94] has been implemented and modified in order to obtain the best possible algorithm for the Aquarels toolbox. It is compared with the other well known algorithms with respect to runtime and intermediate storage
Connecting the dots
, 2010
"... Symbolic Computation is an area of computer science that after 20 years of initial research had its acme in the mid1980s, when its many new algorithms were made available in ”math systems for the masses” like Mathematica and Maple. Computational algebra and computational logic are the two main pill ..."
Abstract
 Add to MetaCart
Symbolic Computation is an area of computer science that after 20 years of initial research had its acme in the mid1980s, when its many new algorithms were made available in ”math systems for the masses” like Mathematica and Maple. Computational algebra and computational logic are the two main
Drawing graphs with dot
, 2006
"... dot draws directed graphs as hierarchies. It runs as a command line program, web visualization service, or with a compatible graphical interface. Its features include welltuned layout algorithms for placing nodes and edge splines, edge labels, “record ” shapes with “ports ” for drawing data structu ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
dot draws directed graphs as hierarchies. It runs as a command line program, web visualization service, or with a compatible graphical interface. Its features include welltuned layout algorithms for placing nodes and edge splines, edge labels, “record ” shapes with “ports ” for drawing data
Connecting the Dots Between News Articles
"... The process of extracting useful knowledge from large datasets has become one of the most pressing problems in today’s society. The problem spans entire sectors, from scientists to intelligence analysts and web users, all of whom are constantly struggling to keep up with the larger and larger amount ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
amounts of content published every day. With this much data, it is often easy to miss the big picture. In this paper, we investigate methods for automatically connecting the dots – providing a structured, easy way to navigate within a new topic and discover hidden connections. We focus on the news domain
Curve Reconstruction: Connecting Dots with Good Reason
 IN PROC. 15TH ANNU. ACM SYMPOS. COMPUT. GEOM
, 1999
"... Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers present algorithms that come with a guarantee: Given a suciently dense sample of a closed smooth curve, the algorithms construct the correct polygonal reconstruction. Nothing is claimed about the ..."
Abstract

Cited by 52 (8 self)
 Add to MetaCart
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers present algorithms that come with a guarantee: Given a suciently dense sample of a closed smooth curve, the algorithms construct the correct polygonal reconstruction. Nothing is claimed about
Survey and taxonomy of ip address lookup algorithms
 IEEE Network
, 2001
"... he primary role of routers is to forward packets toward their final destinations. To this purpose, a router must decide for each incoming packet where to send it next. More exactly, the forwarding decision consists of finding the address of the nexthop router as well as the egress port through whic ..."
Abstract

Cited by 108 (0 self)
 Add to MetaCart
with the increasing traffic, it has been difficult for the packet processing capacity of routers to keep up with these increased data rates. Specifically, the address lookup operation is a major bottleneck in the forwarding performance of today’s routers. This article presents a survey of the latest algorithms
Constructions from dots and lines
 CoRR
"... Summary. A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one another allow for a surprisingly large number of things ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
representation will be useful. If a modeler can leverage the plethora of tools and algorithms that store and process graphs, then such a mapping is worthwhile. This article explores the world of graphs in computing and exposes situations in which graphical models are beneficial. 1 The Bits and Pieces of the Dots
Results 1  10
of
829