5221 search results - page 437 / 1045 » An On-line Problem Database |
174
click to vote
ADBIS
2009
Springer
16 years 1 months ago
2009
Springer
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
151
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
147
click to vote
CIARP
2005
Springer
16 years 12 days ago
2005
Springer
The KNN rule has been widely used in many pattern recognition problems, but it is sensible to noisy data within the training set, therefore, several sample edition methods have bee...
222
click to vote
SPIRE
2005
Springer
16 years 10 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
200
click to vote
SSD
2005
Springer
16 years 10 days ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...