Sciweavers

7015 search results - page 1050 / 1403
» Approximation algorithms for co-clustering
Sort
View
AIPS
2004
15 years 8 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
NIPS
2004
15 years 8 months ago
Learning first-order Markov models for control
First-order Markov models have been successfully applied to many problems, for example in modeling sequential data using Markov chains, and modeling control problems using the Mar...
Pieter Abbeel, Andrew Y. Ng
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
WIS
2004
15 years 8 months ago
A Wireless Data Stream Mining Model
The sensor networks, web click stream and astronomical applications generate a continuous flow of data streams. Most likely data streams are generated in a wireless environment. Th...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
« Prev « First page 1050 / 1403 Last » Next »