Sciweavers

534 search results - page 94 / 107
» Efficient polynomial L-approximations
Sort
View
JALC
2006
143views more  JALC 2006»
13 years 7 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...
JAR
2006
94views more  JAR 2006»
13 years 7 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
DATAMINE
2007
135views more  DATAMINE 2007»
13 years 7 months ago
Experiencing SAX: a novel symbolic representation of time series
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...
Jessica Lin, Eamonn J. Keogh, Li Wei, Stefano Lona...
JCB
2006
115views more  JCB 2006»
13 years 7 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
ML
2008
ACM
101views Machine Learning» more  ML 2008»
13 years 7 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...