Sciweavers

361 search results - page 13 / 73
» Maximum subset intersection
Sort
View
IJCAI
2007
15 years 3 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
JCT
2007
82views more  JCT 2007»
15 years 1 months ago
A new generalization of Mantel's theorem to k-graphs
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
Dhruv Mubayi, Oleg Pikhurko
ICASSP
2008
IEEE
15 years 8 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
14 years 9 months ago
Dynamic product assembly and inventory control for maximum profit
We consider a manufacturing plant that purchases raw materials for product assembly and then sells the final products to customers. There are M types of raw materials and K types o...
Michael J. Neely, Longbo Huang
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy