Sciweavers

1244 search results - page 123 / 249
» Searching in Higher Dimension
Sort
View
SEMWEB
2004
Springer
15 years 12 months ago
Querying Faceted Databases
Faceted classification allows one to model applications with complex classification hierarchies using orthogonal dimensions. Recent work has examined the use of faceted classi...
Kenneth A. Ross, Angel Janevski
DEXA
2003
Springer
162views Database» more  DEXA 2003»
15 years 11 months ago
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
Bonggi Jun, Bonghee Hong, Byunggu Yu
INFOCOM
2002
IEEE
15 years 11 months ago
Design and Scalability of NLS, a Scalable Naming and Location Service
This paper sketches the design, and presents a scalability analysis and evaluation of NLS, a scalable naming and location service. NLS resolves textual names to the nearest of a s...
Y. Charlie Hu, Daniel Rodney, Peter Druschel
SLS
2009
Springer
274views Algorithms» more  SLS 2009»
15 years 11 months ago
A Memetic Algorithm for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Gregory Gutin, Daniel Karapetyan
MDIC
2001
Springer
134views Communications» more  MDIC 2001»
15 years 11 months ago
Querying and Browsing Multimedia Presentations
Querying and searching the Web is an important research field which has drawn a number of concepts from databases and information retrieval fields, but has added its own models, ...
Augusto Celentano, Ombretta Gaggi