Sciweavers

4208 search results - page 529 / 842
» Better Selection of the Best
Sort
View
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 9 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 9 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
ISCI
2007
141views more  ISCI 2007»
15 years 6 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...

Publication
118views
16 years 8 months ago
The Minimum Circuity Frontier and the Journey to Work
People travel between places of residence and work destinations via transportation net- works. The relation between selection of home and work locations has been heavily debated ...
Levinson, D. and El-Geneidy A.