Sciweavers

3 search results - page 1 / 1
» How to Find Big-Oh in Your Data Set (and How Not to)
Sort
View
46
Voted
IDA
1997
Springer
15 years 2 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
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...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
159
Voted
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
15 years 11 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
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...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos

Publication
209views
13 years 9 months ago
An Exploratory Study on Open Conversation Spaces in Global Software Engineering
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...
Kevin Dullemond, Ben van Gameren, Rini van Solinge...