Sciweavers

1605 search results - page 211 / 321
» On Partitional Labelings of Graphs
Sort
View
ACL
2010
13 years 8 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev
ACL
2009
13 years 8 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
PAMI
2010
207views more  PAMI 2010»
13 years 4 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
14 years 2 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
STACS
2000
Springer
14 years 1 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...