5022 search results - page 351 / 1005 » Data structures and problem solving using Java |
168
click to vote
PODS
1995
ACM
15 years 7 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
104
Voted
NIPS
2001
15 years 5 months ago
2001
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very ...
142
Voted
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
131
Voted
KDD
1994
ACM
15 years 7 months ago
1994
ACM
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn required semantic rules has no...
116
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...