Sciweavers

555 search results - page 72 / 111
» Decompositions of Grammar Constraints
Sort
View
ICML
2004
IEEE
14 years 1 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
CAIP
1997
Springer
155views Image Analysis» more  CAIP 1997»
14 years 20 days ago
Discrete-Time Rigidity-Constrained Optical Flow
An algorithm for optical ow estimation is presented for the case of discrete-time motion of an uncalibrated camera through a rigid world. Unlike traditional optical ow approaches t...
Jeffrey Mendelsohn, Eero P. Simoncelli, Ruzena Baj...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 8 months ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy
ACL
1998
13 years 10 months ago
The Production of Code-Mixed Discourse
We propose a comprehensive theory of codemixed discourse, encompassing equivalencepoint and insertional code-switching, palindromic constructions and lexical borrowing. The starti...
David Sankoff
ACL
2010
13 years 6 months ago
Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
Valentin I. Spitkovsky, Daniel Jurafsky, Hiyan Als...