Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Boulos Harb"'
Publikováno v:
Proceedings of the VLDB Endowment. 8:1752-1763
The most effective way to explore data is through visualizing the results of exploration queries. For example, an exploration query could be an aggregate of some measures over time intervals, and a pattern or abnormality can be discovered through a t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f55625779414c505856b5fba570b124
https://doi.org/10.14778/2824032.2824072
https://doi.org/10.14778/2824032.2824072
Publikováno v:
Journal of Computational Biology. 14:701-723
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore conserved) substrings that are shared between all mammals and not found
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5be823c03938df70088e096bf816f74a
https://doi.org/10.1089/cmb.2007.r011
https://doi.org/10.1089/cmb.2007.r011
Autor:
Boulos Harb
Publikováno v:
Journal of Eastern Christian Studies. 54:119-125
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32c3d99b49df7e824dc3d4912487a84a
https://doi.org/10.2143/jecs.54.1.503683
https://doi.org/10.2143/jecs.54.1.503683
Publikováno v:
ICDE
An increasing number of Web applications such as friends recommendation depend on the ability to join objects at scale. The traditional approach taken is nearest neighbor join (also called similarity join), whose goal is to find, based on a given joi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d921d891273d7cb3d03d4ad3ad6d9f6
https://doi.org/10.1109/icde.2014.6816728
https://doi.org/10.1109/icde.2014.6816728
Publikováno v:
ICDE
Google Fusion Tables aims to support an ecosystem of structured data on the Web by providing a tool for managing and visualizing data on the one hand, and for searching and exploring for data on the other. This paper describes a few recent developmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1cbc278961f7fd17f66e822c9a2bf6e0
https://doi.org/10.1109/icde.2013.6544808
https://doi.org/10.1109/icde.2013.6544808
Publikováno v:
ICASSP
We present an analysis of music modeling and recognition techniques in the context of mobile music matching, substantially improving on the techniques presented in [1]. We accomplish this by adapting the features specifically to this task, and by int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6f51f7852cf3ccee336b1946c57c1aa
https://doi.org/10.1109/icassp.2012.6288387
https://doi.org/10.1109/icassp.2012.6288387
Publikováno v:
Interspeech 2009.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29087ab1c6e68abdbab7f71ec1a24a72
https://doi.org/10.21437/interspeech.2009-113
https://doi.org/10.21437/interspeech.2009-113
Publikováno v:
KDD
We consider feature selection for text classification both theoretically and empirically. Our main result is an unsupervised feature selection strategy for which we give worst-case theoretical guarantees on the generalization power of the resultant c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e1b94ff9297c55b349eaa723bcda3be
https://doi.org/10.1145/1281192.1281220
https://doi.org/10.1145/1281192.1281220
Autor:
Sudipto Guha, Boulos Harb
This paper addresses the problem of finding a B-term wavelet representation of a given discrete function $f \in \real^n$ whose distance from f is minimized. The problem is well understood when we seek to minimize the Euclidean distance between f and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::478ab2452ae5be54da7960bd45dfe3e4
http://arxiv.org/abs/cs/0604097
http://arxiv.org/abs/cs/0604097
Publikováno v:
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b5e5dfac6767ea9518e6a80ba86957d
https://doi.org/10.1145/1109557.1109643
https://doi.org/10.1145/1109557.1109643