5606 search results - page 592 / 1122 » Randomization Techniques for Graphs. |
195
click to vote
VLSID
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
172
click to vote
USS
2008
15 years 9 months ago
2008
Generation of random numbers is a critical component of existing post-election auditing techniques. Recent work has largely discouraged the use of all pseudorandom number generato...
187
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
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...
167
click to vote
ACL
2004
15 years 8 months ago
2004
Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as "thumbs up" or "thumbs down&qu...
156
click to vote
ALENEX
2001
15 years 8 months ago
2001
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilita...