Sciweavers

265 search results - page 21 / 53
» Fisher Kernels for Relational Data
Sort
View
EFDBS
2001
15 years 1 months ago
Augmenting SQL with Dynamic Restructuring to Support Interoperability in a Relational Federation
In this work, we consider augmenting SQL with constructs allowing dynamic restructuring. Dynamic restructuring occurs naturally in a framework including second-order capabilities f...
Catharine M. Wyss, Felix I. Wyss, Dirk Van Gucht
ICML
2006
IEEE
16 years 17 days ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
110
Voted
CVPR
2005
IEEE
16 years 1 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
79
Voted
ICASSP
2008
IEEE
15 years 6 months ago
Fine: Information embedding for document classification
The problem of document classification considers categorizing or grouping of various document types. Each document can be represented as a bag of words, which has no straightforw...
Kevin M. Carter, Raviv Raich, Alfred O. Hero
BTW
2007
Springer
133views Database» more  BTW 2007»
15 years 3 months ago
Pathfinder: XQuery Compila-tion Techniques for Relational Database Targets
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
Jens Teubner