Sciweavers

4432 search results - page 639 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
82
Voted
NIPS
2007
15 years 2 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
DAGSTUHL
2004
15 years 2 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang
IJCAI
2001
15 years 2 months ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
WSCG
2004
120views more  WSCG 2004»
15 years 2 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
NIPS
2003
15 years 2 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi