Sciweavers

7820 search results - page 294 / 1564
» Formalization of Time and Space
Sort
View
INFOCOM
2006
IEEE
16 years 1 months ago
Evaluating Mobility Pattern Space Routing for DTNs
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
Jeremie Leguay, Timur Friedman, Vania Conan
ICALP
2005
Springer
16 years 28 days ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
CODES
2003
IEEE
16 years 21 days ago
Schedule-aware performance estimation of communication architecture for efficient design space exploration
In this paper, we are concerned about the performance estimation of bus-based architectures assuming that the task partitioning on the processing components is already determined....
Sungchan Kim, Chaeseok Im, Soonhoi Ha
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 12 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
IPPS
2000
IEEE
15 years 11 months ago
Exploring the Switch Design Space in a CC-NUMA Multiprocessor Environment
The switch design for interconnection networks plays an important role in the overall performance of multiprocessors and computer networks. It is therefore crucial to study variou...
Marius Pirvu, Nan Ni, Laxmi N. Bhuyan