3663 search results - page 357 / 733 » Problems in the ontology of computer programs |
152
Voted
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
190
click to vote
CHI
2005
ACM
16 years 7 months ago
2005
ACM
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
208
click to vote
SP
2008
IEEE
16 years 1 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
208
click to vote
VL
2006
IEEE
16 years 24 days ago
2006
IEEE
Now that we have end-user programming environments capable of empowering kids with no programming background to build games in a matter of hours, a new quest for raising the ceili...
183
click to vote
WOMPAT
2001
Springer
15 years 11 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...