Sciweavers

88 search results - page 5 / 18
» Regular Cost Functions over Finite Trees
Sort
View
ICFP
2006
ACM
14 years 9 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
ICASSP
2011
IEEE
13 years 1 months ago
Median filter with absolute value norm spatial regularization
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
Nilanjan Ray
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 11 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
ENTCS
2002
103views more  ENTCS 2002»
13 years 9 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
ICML
2008
IEEE
14 years 10 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...