Sciweavers

1387 search results - page 62 / 278
» Convexity in Discrete Space
Sort
View
ICML
2009
IEEE
14 years 12 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
IROS
2006
IEEE
93views Robotics» more  IROS 2006»
14 years 5 months ago
General Kinematic Synthesis Method for a Discretely Actuated Robotic Manipulator (D-ARM)
— A “Discretely Actuated Robotic Manipulator”, or “D-ARM”, is any member of a class of robotic manipulators powered by actuators that have only discrete positional stable...
Keizo Miyahara, Gregory S. Chirikjian
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
14 years 4 months ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
COMPGEOM
2007
ACM
14 years 3 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary