Sciweavers

248 search results - page 29 / 50
» Whole word discriminative point process models
Sort
View
JMLR
2002
137views more  JMLR 2002»
13 years 8 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
ENTCS
2007
119views more  ENTCS 2007»
13 years 8 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 8 months ago
Profile Based Sub-Image Search in Image Databases
Sub-image search with high accuracy in natural images still remains a challenging problem. This paper proposes a new feature vector called profile for a keypoint in a bag of visual...
Vishwakarma Singh, Ambuj K. Singh
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
ACL
1998
13 years 9 months ago
Combining Stochastic and Rule-Based Methods for Disambiguation in Agglutinative Languages
In this paper we present the results of the combination of stochastic and rule-based disambiguation methods applied to Basque languagel. The methods we have used in disambiguation...
Nerea Ezeiza, Iñaki Alegria, Jose Maria Arr...