Sciweavers

339 search results - page 25 / 68
» Universality Results for Models in Locally Boolean Domains
Sort
View
LATA
2009
Springer
14 years 3 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
JCP
2006
74views more  JCP 2006»
13 years 8 months ago
Local Boosting of Decision Stumps for Regression and Classification Problems
Numerous data mining problems involve an investigation of associations between features in heterogeneous datasets, where different prediction models can be more suitable for differ...
Sotiris B. Kotsiantis, Dimitris Kanellopoulos, Pan...
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 8 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
PAMI
2007
353views more  PAMI 2007»
13 years 8 months ago
Dynamic Texture Recognition Using Local Binary Patterns with an Application to Facial Expressions
— Dynamic texture is an extension of texture to the temporal domain. Description and recognition of dynamic textures have attracted growing attention. In this paper, a novel appr...
Guoying Zhao, Matti Pietikäinen
MOC
2010
13 years 3 months ago
Sharply local pointwise a posteriori error estimates for parabolic problems
Abstract. We prove pointwise a posteriori error estimates for semi- and fullydiscrete finite element methods for approximating the solution u to a parabolic model problem. Our esti...
Alan Demlow, Charalambos Makridakis