2056 search results - page 136 / 412 » time 2000 |
146
click to vote
SIAMJO
2000
15 years 4 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
138
Voted
MICS
2010
15 years 3 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
145
Voted
CIDU
2010
15 years 3 months ago
2010
Ecosystem-related observations from remote sensors on satellites offer huge potential for understanding the location and extent of global land cover change. This paper presents a c...
158
Voted
SODA
2000
ACM
15 years 6 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
146
click to vote
CGO
2003
IEEE
15 years 10 months ago
2003
IEEE
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...