Sciweavers

867 search results - page 75 / 174
» The Generalized Maximum Coverage Problem
Sort
View
ACL
1998
13 years 9 months ago
Some Properties of Preposition and Subordinate Conjunction Attachments
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
Alexander S. Yeh, Marc B. Vilain
LREC
2008
103views Education» more  LREC 2008»
13 years 9 months ago
A Knowledge-Modeling Approach for Multilingual Regulus Lexica
Development of lexical resources is, along with grammar development, one of the main efforts when building multilingual NLP applications. In this paper, we present a tool-based ap...
Marianne Santaholma, Nikos Chatzichrisafis
INFOCOM
2005
IEEE
14 years 1 months ago
Dynamic node activation in networks of rechargeable sensors
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
Koushik Kar, Ananth Krishnamurthy, Neeraj Jaggi
ICCV
2003
IEEE
14 years 10 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
CVPR
2009
IEEE
14 years 2 months ago
On bias correction for geometric parameter estimation in computer vision
Maximum likelihood (ML) estimation is widely used in many computer vision problems involving the estimation of geometric parameters, from conic fitting to bundle adjustment for s...
Takayuki Okatani, Koichiro Deguchi