1237 search results - page 133 / 248 » Strictness and Totality Analysis |
169
click to vote
COLING
1990
15 years 7 months ago
1990
We consider the problem of extracting specified types of information from natural language text. To properly analyze the text, we wish to apply semantic (selectional) constraints ...
149
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
240
Voted
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
153
Voted
CODES
2005
IEEE
15 years 11 months ago
2005
IEEE
In embedded cryptosystems, sensitive information can leak via timing, power, and electromagnetic channels. We introduce a novel power-smart system-on-chip architecture that provid...
177
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...