Sciweavers

240 search results - page 8 / 48
» Low Cost Databases for NOW
Sort
View
SSD
2005
Springer
98views Database» more  SSD 2005»
15 years 3 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CIKM
2010
Springer
14 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
SAFECOMP
1998
Springer
15 years 2 months ago
Increasing System Safety for By-Wire Applications in Vehicles by Using a Time Triggered Architecture
By-wire systems have been established for several years in the area of aircraft construction and there are now approaches to utilize this technology in vehicles. The required elect...
Thomas Ringler, J. Steiner, R. Belschner, Bernd He...
LREC
2008
145views Education» more  LREC 2008»
14 years 11 months ago
Borrowing Language Resources for Development of Automatic Speech Recognition for Low- and Middle-Density Languages
In this paper we describe an approach that both creates crosslingual acoustic monophone model sets for speech recognition tasks and objectively predicts their performance without ...
Lynette Melnar, Chen Liu
ICIP
2007
IEEE
15 years 4 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose