2631 search results - page 368 / 527 » Less is More |
168
click to vote
TRIER
2002
15 years 3 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
142
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
181
click to vote
ALT
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
135
click to vote
ARITH
2009
IEEE
15 years 10 months ago
2009
IEEE
—The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advan...
134
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...