Sciweavers

109 search results - page 5 / 22
» New Rewritings and Optimizations for Regular Path Queries
Sort
View
103
Voted
ICML
2007
IEEE
16 years 15 days 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...
VLDB
2004
ACM
101views Database» more  VLDB 2004»
15 years 5 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
DATESO
2010
184views Database» more  DATESO 2010»
14 years 9 months ago
iXUPT: Indexing XML Using Path Templates
The XML format has become the standard for data exchange because it is self-describing and it stores not only information but also the relationships between data. Therefore it is u...
Tomás Bartos, Ján Kasarda
SEBD
2008
178views Database» more  SEBD 2008»
15 years 1 months ago
A New Generation Search Engine Supporting Cross Domain Queries
d Abstract) Daniele Braga1 , Diego Calvanese2 , Alessandro Campi1 , Stefano Ceri1 , Florian Daniel1 , Davide Martinenghi1 , Paolo Merialdo3 , Riccardo Torlone3 1 Dip. di Elettronic...
Daniele Braga, Diego Calvanese, Alessandro Campi, ...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 5 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang