590 search results - page 54 / 118 » Can We Learn to Beat the Best Stock |
NIPS
2007
14 years 11 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
117
click to vote
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
123
click to vote
ICSNC
2007
IEEE
15 years 4 months ago
2007
IEEE
Nowadays, path prediction is being extensively examined for use in the context of mobile and wireless computing towards more efficient network resource management schemes. Path pr...
BMCBI
2010
14 years 10 months ago
2010
Background: Discovering novel disease genes is still challenging for diseases for which no prior knowledge - such as known disease genes or disease-related pathways - is available...
CVPR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an o...