3602 search results - page 157 / 721 » Isn't It About Time |
CCR
2008
13 years 10 months ago
2008
The goal of this column this time was to address major scientific issues and propose novel scientific methods for doing the same thing under different names. However, it turned ou...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
IJMI
2006
13 years 10 months ago
2006
In this paper we describe a methodology that emerged during a healthcare project, which consisted among others in grouping information from heterogeneous and distributed informati...
DAM
2007
13 years 10 months ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
JMLR
2006
13 years 10 months ago
2006
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...