Sciweavers

6315 search results - page 284 / 1263
» Approximating Solution Structure
Sort
View
INFORMS
2008
241views more  INFORMS 2008»
15 years 6 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
MLDM
2008
Springer
15 years 6 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic
MOC
2010
15 years 1 months ago
A numerical method for fractal conservation laws
: We consider a fractal scalar conservation law, that is to say a conservation law modified by a fractional power of the Laplace operator, and we propose a numerical method to appr...
Jérôme Droniou
ICML
2009
IEEE
16 years 7 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
COMGEO
2007
ACM
15 years 6 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...