Sciweavers

587 search results - page 90 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
ECCV
2008
Springer
15 years 7 months ago
Unsupervised Classification and Part Localization by Consistency Amplification
We present a novel method for unsupervised classification, including the discovery of a new category and precise object and part localization. Given a set of unlabelled images, som...
Leonid Karlinsky, Michael Dinerstein, Dan Levi, Sh...
CORR
2012
Springer
218views Education» more  CORR 2012»
14 years 1 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
DAC
2003
ACM
16 years 6 months ago
Multilevel floorplanning/placement for large-scale modules using B*-trees
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-sca...
Hsun-Cheng Lee, Yao-Wen Chang, Jer-Ming Hsu, Hanna...
COMPGEOM
1994
ACM
15 years 10 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir