Sciweavers

99 search results - page 5 / 20
» Improved bounds and new techniques for Davenport-Schinzel se...
Sort
View
ACL
2003
13 years 9 months ago
Word Sense Disambiguation Using Pairwise Alignment
In this paper, we proposed a new supervised word sense disambiguation (WSD) method based on a pairwise alignment technique, which is used generally to measure a similarity between...
Koichi Yamashita, Keiichi Yoshida, Yukihiro Itoh
DAC
2006
ACM
14 years 9 months ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
SIAMCOMP
2012
11 years 10 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
DAC
2009
ACM
14 years 9 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...