Sciweavers

12334 search results - page 2378 / 2467
» The Use of C
Sort
View
COCOON
1998
Springer
15 years 2 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
15 years 2 months ago
The InfoSleuth Project
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
Roberto J. Bayardo Jr., William Bohrer, Richard S....
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 2 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
AGENTS
1997
Springer
15 years 2 months ago
High-Level Planning and Low-Level Execution: Towards a Complete Robotic Agent
We have been developing Rogue, an architecture that integrates high-level planning with a low-level executing robotic agent. Rogue is designed as the oce gofer task planner for X...
Karen Zita Haigh, Manuela M. Veloso
LOPSTR
1997
Springer
15 years 2 months ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
« Prev « First page 2378 / 2467 Last » Next »