Sciweavers

2675 search results - page 523 / 535
» From Ontology to Relational Databases
Sort
View
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
16 years 24 days ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
CLUSTER
2009
IEEE
16 years 23 days ago
MDCSim: A multi-tier data center simulation, platform
Abstract—Performance and power issues are becoming increasingly important in the design of large cluster based multitier data centers for supporting a multitude of services. Desi...
Seung-Hwan Lim, Bikash Sharma, Gunwoo Nam, Eun-Kyo...
CIKM
2009
Springer
16 years 18 days ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
IWCIA
2009
Springer
16 years 17 days ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...