Sciweavers

3381 search results - page 105 / 677
» Extending Dependencies with Conditions
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 6 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
JMLR
2002
90views more  JMLR 2002»
15 years 6 months ago
Machine Learning with Data Dependent Hypothesis Classes
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...
Adam Cannon, J. Mark Ettinger, Don R. Hush, Clint ...
SIGIR
2004
ACM
15 years 11 months ago
Dependence language model for information retrieval
This paper presents a new dependence language modeling approach to information retrieval. The approach extends the basic language modeling approach based on unigram by relaxing th...
Jianfeng Gao, Jian-Yun Nie, Guangyuan Wu, Guihong ...
ECCV
2010
Springer
14 years 19 days ago
Voting by Grouping Dependent Parts
Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
CADE
2007
Springer
16 years 6 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur