683 search results - page 42 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
SIGMOD
1999
ACM
14 years 4 days ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
The Web is a dynamic, ever changing collection of information. This paper explores changes in Web content by analyzing a crawl of 55,000 Web pages, selected to represent different...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agen...