2030 search results - page 169 / 406 » Extremal Problems of Information Combining |
192
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
156
click to vote
IPSN
2010
Springer
16 years 27 days ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
156
click to vote
FOCS
2007
IEEE
16 years 12 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
145
click to vote
SEMWEB
2007
Springer
16 years 5 days ago
2007
Springer
Our research explores the possibilities for factoring culture into user models, working towards cultural adaptivity in the semantic web. The aim is to represent the user’s positi...
204
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...