2107 search results - page 30 / 422 » Computing Small Search Numbers in Linear Time |
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
AIED
2007
Springer
14 years 1 months ago
2007
Springer
The efficacy of a tutoring system for pre-algebra instruction plus human tutoring was compared to instruction provided to small groups of middle school students by experienced huma...
STOC
2010
ACM
14 years 15 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
SETN
2010
Springer
13 years 11 months ago
2010
Springer
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...