1554 search results - page 42 / 311 » cases 2003 |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
181
click to vote
VLDB
2003
ACM
15 years 10 months ago
2003
ACM
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
PVM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Fortran language has evolved substantially from the Fortran 77 bindings defined in the MPI-1 (Message Passing Interface) standard. Fortran 90 introduced interface bl...
CIVR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we present the results of a user study that was conducted in combination with a submission to TRECVID 2003. Search behavior of students querying an interactive video-...