Sciweavers

905 search results - page 50 / 181
» On the Complexity of uSPR Distance
Sort
View
ETS
2002
IEEE
166views Hardware» more  ETS 2002»
15 years 16 days ago
Distributed and Online Distance Lecturing Environment (The Virtual Blackboard Project)
Computers and networks are increasingly able to support distributed collaborative multimedia applications. In fact, the growing interest in distance learning reflects the awarenes...
Yiannis N. Sagias
117
Voted
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 10 months ago
Data Editing Techniques to Allow the Application of Distance-Based Outlier Detection to Streams
The problem of finding outliers in data has broad applications in areas as diverse as data cleaning, fraud detection, network monitoring, invasive species monitoring, etc. While th...
Vit Niennattrakul, Eamonn J. Keogh, Chotirat Ann R...
143
Voted
ENTCS
2002
207views more  ENTCS 2002»
15 years 17 days ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
98
Voted
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
15 years 7 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
101
Voted
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
15 years 5 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson