Sciweavers

188 search results - page 16 / 38
» The 2-center problem in three dimensions
Sort
View
CEC
2008
IEEE
13 years 11 months ago
A technique for the visualization of population-based algorithms
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...
Konstantinos E. Parsopoulos, Voula C. Georgopoulos...
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 8 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi

Publication
200views
12 years 5 months ago
Learning Tags from Unsegmented Videos of Multiple Human Actions
Providing methods to support semantic interaction with growing volumes of video data is an increasingly important challenge for data mining. To this end, there has been some succes...
Timothy Hospedales, Shaogang Gong, Tao Xiang
PAMI
2010
222views more  PAMI 2010»
13 years 8 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 10 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen