#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1997

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hanan Samet, Jagan Sankaranarayanan, Houman Alborzi
- SIGMOD Conference
- 2008

An algorithm is presented for finding the <i>k</i> nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between all possible vertices in the network and then making use of an encoding that takes advantage of the fact that the shortest paths from vertex <i>u</i> to all… (More)

A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses <i>path coherence</i> between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding that is compact in representation and fast in path… (More)

- Jagan Sankaranarayanan, Hanan Samet, Houman Alborzi
- PVLDB
- 2009

The advent of location-based services has led to an increased demand for performing operations on spatial networks in real time. The challenge lies in being able to cast operations on spatial networks in terms of relational operators so that they can be performed in the context of a database. A linear-sized construct termed a path oracle is introduced that… (More)

To model on-line systems which deal with multi-threaded inputs, we deene and analyze the k-client problem, a dual of the k-server problem. In the k-client problem, there is a single server and k clients, each of which generates a sequence of requests for service in a metric space. At any time, each client has at most one outstanding request; that is, the i… (More)

- Houman Alborzi, Allison Druin, +13 authors James A. Hendler
- Symposium on Designing Interactive Systems
- 2000

Costly props, complicated authoring technologies, and limited access to space are among the many reasons why children can rarely enjoy the experience of authoring room-sized interactive stories. Typically in these kinds of environments, children are restricted to being story participants, rather than story authors. Therefore, we have begun the development… (More)

- Hanan Samet, Houman Alborzi, +4 authors Egemen Tanin
- Commun. ACM
- 2003

Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release.… (More)

The result of a distance join operation on two sets of objects <i>R, S</i> on a spatial network <i>G</i> is a set <i>P</i> of object pairs <i>pq</i>, <i>p É R</i>, <i>q É S</i> such that the distance of an object pair <i>pq</i> is the shortest distance from <i>p</i> to <i>q</i> in <i>G</i>. Several variations to the distance join operation such as… (More)

- Jaime Montemayor, Houman Alborzi, +12 authors Rebecca Wagner
- 2000

Working with children as our design partners, our intergenerational design team at the University of Maryland has been developing both new design methodologies and new storytelling technology for children. In this paper, we focus on two recent results of our efforts: PETS, a robotic storyteller, and Storykit, a construction kit of low-tech and high-tech… (More)

- Lisa Sherman, Allison Druin, +12 authors Abby Lal
- CHI Extended Abstracts
- 2001

Children enjoy interactive museum experiences, fun houses, and amusement parks, but children are not the authors of these immersive storytelling experiences. They are merely the audience or participants in an environment built by adults. We believe an important educational opportunity is being overlooked. Therefore, we have developed what we call a… (More)

- Houman Alborzi, Hanan Samet
- Inf. Process. Lett.
- 2007

A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y. which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is… (More)