Sciweavers

550 search results - page 22 / 110
» pairing 2009
Sort
View
CCCG
2009
14 years 10 months ago
Nucleation-free 3D rigidity
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
Jialong Cheng, Meera Sitharam, Ileana Streinu
EACL
2009
ACL Anthology
14 years 7 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
ICDAR
2009
IEEE
14 years 7 months ago
Finding the Most Probable Ranking of Objects with Probabilistic Pairwise Preferences
This paper discusses the ranking of a set of objects when a possibly inconsistent set of pairwise preferences is given. We consider the task of ranking objects when pairwise prefe...
Mikhail Parakhin, Patrick M. Haluptzok
ACL
2009
14 years 7 months ago
Mining Bilingual Data from the Web with Adaptively Learnt Patterns
Mining bilingual data (including bilingual sentences and terms1 ) from the Web can benefit many NLP applications, such as machine translation and cross language information retrie...
Long Jiang, Shiquan Yang, Ming Zhou, Xiaohua Liu, ...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
15 years 4 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee