801 search results - page 140 / 161 » Minimal Locked Trees |
101
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
BIBM
2010
IEEE
14 years 7 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
INFORMATICALT
2011
14 years 4 months ago
2011
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
JMLR
2010
14 years 4 months ago
2010
In this paper we learn a dissimilarity measure for categorical data, for effective classification of the data points. Each categorical feature (with values taken from a finite set...
150
click to vote
CPAIOR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...