Sciweavers

1672 search results - page 229 / 335
» Tightness problems in the plane
Sort
View
NIPS
2008
15 years 8 months ago
An Extended Level Method for Efficient Multiple Kernel Learning
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
Zenglin Xu, Rong Jin, Irwin King, Michael R. Lyu
NIPS
2007
15 years 8 months ago
Measuring Neural Synchrony by Message Passing
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
Justin Dauwels, François B. Vialatte, Tomas...
AAAI
1998
15 years 8 months ago
Toward Design as Collaboration
In design, multiple disparate goals must be addressed simultaneously. It is the thesis of this work that problems in two-dimensional layout design can be solved by collaboration a...
Susan L. Epstein
SODA
1996
ACM
101views Algorithms» more  SODA 1996»
15 years 8 months ago
Randomized Robot Navigation Algorithms
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...
CCCG
2009
15 years 7 months ago
Optimal Empty Pseudo-Triangles in a Point Set
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher