4085 search results - page 666 / 817 » Data Services - From Data to Containers |
149
click to vote
IFIPPACT
1994
15 years 5 months ago
1994
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
129
Voted
OSDI
1994
ACM
15 years 5 months ago
1994
ACM
Operating system research has endeavored to develop micro-kernels that provide modularity, reliability and security improvements over conventional monolithic kernels. However, the...
128
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
133
Voted
MVA
1990
15 years 4 months ago
1990
This paper presents an image processing method for locating underground linear objects using ground-probing radar data. One of the problems when using groundprobing radars is how ...
131
Voted
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
In sponsored search auctions, advertisers choose a set of keywords based on products they wish to market. They bid for advertising slots that will be displayed on the search result...