Sciweavers

3394 search results - page 40 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 12 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
NIPS
2004
13 years 9 months ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
ADHOCNOW
2003
Springer
14 years 29 days ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
13 years 11 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini