11862 search results - page 407 / 2373 » Relative information completeness |
195
click to vote
ICCAD
2002
IEEE
16 years 4 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
220
click to vote
RECOMB
2010
Springer
16 years 2 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
228
click to vote
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
179
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
210
click to vote
WEBDB
2005
Springer
16 years 23 days ago
2005
Springer
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...