3 search results - page 1 / 1 » How to Find Big-Oh in Your Data Set (and How Not to) |
IDA
1997
Springer
14 years 3 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
ICDE
2000
IEEE
15 years 15 days ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Publication
Software engineering is by nature a highly collaborative
activity and being able to collaborate effectively is a
key factor for project success. However, collaborating effectivel...