10289 search results - page 47 / 2058 » Standard bases in K |
154
click to vote
SPIRE
2005
Springer
15 years 7 months 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...
103
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
116
click to vote
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
105
click to vote
TCS
2008
15 years 1 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
220
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...