Sciweavers

694 search results - page 40 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
TKDE
2008
153views more  TKDE 2008»
13 years 8 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
PVLDB
2008
82views more  PVLDB 2008»
13 years 8 months ago
Mining non-redundant high order correlations in binary data
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
Xiang Zhang, Feng Pan, Wei Wang 0010, Andrew B. No...
DEBU
2010
147views more  DEBU 2010»
13 years 9 months ago
Indoor - A New Data Management Frontier
Much research has been conducted on the management of outdoor moving objects. In contrast, relatively little research has been conducted on indoor moving objects. The indoor setti...
Christian S. Jensen, Hua Lu, Bin Yang 0002
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 10 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 11 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...