5169 search results - page 693 / 1034 » Locality approximation using time |
189
Voted
EMNLP
2010
15 years 3 months ago
2010
We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle ...
162
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
209
Voted
JMLR
2012
13 years 8 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
214
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Efficient and accurate fitting of Active Appearance
Models (AAM) is a key requirement for many applications.
The most efficient fitting algorithm today is Inverse Compositional
...
136
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...