Sciweavers

16504 search results - page 392 / 3301
» New Problems, New Solutions
Sort
View
SIAMJO
2000
105views more  SIAMJO 2000»
15 years 6 months ago
On the Identification of Zero Variables in an Interior-Point Framework
Abstract. We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a n...
Francisco Facchinei, Andreas Fischer, Christian Ka...
197
Voted
JOTA
2011
149views more  JOTA 2011»
15 years 1 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
182
Voted
ICASSP
2011
IEEE
14 years 10 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 7 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
FOCS
2000
IEEE
15 years 11 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg