Sciweavers

2069 search results - page 243 / 414
» Linear time algorithms for Clobber
Sort
View
NJC
2006
102views more  NJC 2006»
15 years 6 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
NIPS
2004
15 years 8 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 12 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
PVLDB
2008
126views more  PVLDB 2008»
15 years 6 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
DISOPT
2008
78views more  DISOPT 2008»
15 years 6 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...