Sciweavers

845 search results - page 67 / 169
» Complexity Dimensions and Learnability
Sort
View
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
15 years 1 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 10 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...
ICASSP
2011
IEEE
14 years 7 months ago
Polynomial expansion detector for uniform linear arrays
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
Antonia Maria Masucci, Øyvind Ryan, M&eacut...
ECCV
2008
Springer
16 years 5 months ago
Higher Dimensional Affine Registration and Vision Applications
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
Yu-Tseh Chi, S. M. Nejhum Shahed, Jeffrey Ho, Ming...
140
Voted
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 3 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel