Sciweavers

750 search results - page 105 / 150
» Aggregates in Possibilistic Databases
Sort
View
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
14 years 1 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
W3C
1998
13 years 11 months ago
A Query Language for XML
An important application of XML is the interchange of electronic data (EDI) between multiple data sources on the Web. As XML data proliferates on the Web, applications will need t...
Mary F. Fernandez, Dan Suciu
GLOBECOM
2008
IEEE
13 years 11 months ago
Automatic Large Scale Generation of Internet PoP Level Maps
—Point of presence (PoP) level Internet maps are promising for tasks such as reasoning about the Internet evolution in time or Internet delay estimation. We thus suggest an effi...
Dima Feldman, Yuval Shavitt
CVPR
2011
IEEE
13 years 5 months ago
Ordinal Hyperplanes Ranker with Cost Sensitivities for Age Estimation
In this paper, we propose an ordinal hyperplane ranking algorithm called OHRank, which estimates human ages via facial images. The design of the algorithm is based on the relative...
Kuang-Yu Chang, Chu-Song Chen, Yi-Ping Hung
PVLDB
2011
13 years 22 days ago
CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop
Hadoop has become an attractive platform for large-scale data analytics. In this paper, we identify a major performance bottleneck of Hadoop: its lack of ability to colocate relat...
Mohamed Y. Eltabakh, Yuanyuan Tian, Fatma Özc...