Sciweavers

2434 search results - page 55 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
KES
2010
Springer
15 years 1 months ago
Extracting Principal Components from Pseudo-random Data by Using Random Matrix Theory
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
Mieko Tanaka-Yamawaki
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
15 years 4 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
CP
2000
Springer
15 years 7 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
114
Voted
DKE
2008
72views more  DKE 2008»
15 years 3 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
ICCV
2009
IEEE
15 years 1 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li