Sciweavers

377 search results - page 9 / 76
» Learning Linear Ordering Problems for Better Translation
Sort
View
84
Voted
AAAI
2007
14 years 12 months ago
Kernel Regression with Order Preferences
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
Xiaojin Zhu, Andrew B. Goldberg
ECCV
2006
Springer
15 years 11 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
JACM
2007
132views more  JACM 2007»
14 years 9 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
ICML
2005
IEEE
15 years 10 months ago
Linear Asymmetric Classifier for cascade detectors
The detection of faces in images is fundamentally a rare event detection problem. Cascade classifiers provide an efficient computational solution, by leveraging the asymmetry in t...
Jianxin Wu, Matthew D. Mullin, James M. Rehg
74
Voted
JOLLI
2007
128views more  JOLLI 2007»
14 years 9 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...