1083 search results - page 13 / 217 » Efficient Discovery of Confounders in Large Data Sets |
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
ACL
2009
13 years 5 months ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
PVLDB
2008
13 years 7 months ago
2008
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
IPPS
2003
IEEE
14 years 27 days ago
2003
IEEE
In this paper we propose a novel architecture, CARD, for resource discovery in large scale MANets that may scale up to thousands of nodes. Our mechanism is suitable for resource d...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...