Sciweavers

1019 search results - page 80 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
CGF
2006
191views more  CGF 2006»
13 years 8 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 8 months ago
Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach
— We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequencyflat Gaussian...
Daniele Angelosante, Ezio Biglieri, Marco Lops
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 2 months ago
XCS for robust automatic target recognition
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyo...
B. Ravichandran, Avinash Gandhe, Robert E. Smith
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
11 years 11 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
CIKM
2009
Springer
14 years 21 days ago
Robust record linkage blocking using suffix arrays
Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, a quadratic ...
Timothy de Vries, Hui Ke, Sanjay Chawla, Peter Chr...