Sciweavers

478 search results - page 28 / 96
» Context-Sensitive Dependency Pairs
Sort
View
PLDI
2004
ACM
15 years 5 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
FLAIRS
2006
15 years 1 months ago
Dependency-based Textual Entailment
This paper studies the role of dependency information for the task of textual entailment. Both the Text and Hypothesis of an entailment pair are mapped into sets of dependencies a...
Vasile Rus
EMNLP
2009
14 years 9 months ago
Recognizing Implicit Discourse Relations in the Penn Discourse Treebank
We present an implicit discourse relation classifier in the Penn Discourse Treebank (PDTB). Our classifier considers the context of the two arguments, word pair information, as we...
Ziheng Lin, Min-Yen Kan, Hwee Tou Ng
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
15 years 3 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
88
Voted
ISLPED
2007
ACM
75views Hardware» more  ISLPED 2007»
15 years 1 months ago
Minimizing power dissipation during write operation to register files
This paper presents a power reduction mechanism for the write operation in register files (RegFiles), which adds a conditional charge-sharing structure to the pair of complementar...
Kimish Patel, Wonbok Lee, Massoud Pedram