Sciweavers

552 search results - page 69 / 111
» Constrained Shortest Path Computation
Sort
View
92
Voted
ICML
2007
IEEE
15 years 10 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
85
Voted
SIGCOMM
1989
ACM
15 years 1 months ago
The Revised ARPANET Routing Metric
The ARPANBT routing metric wasrevised in July 1987,resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revis...
A. Khanna, John A. Zinky
74
Voted
BIRTHDAY
2009
Springer
15 years 4 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
80
Voted
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 2 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
DBA
2004
93views Database» more  DBA 2004»
14 years 11 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke