2925 search results - page 119 / 585 » Information Complexity of Online Problems |
192
click to vote
IPM
2006
15 years 6 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
233
click to vote
PROMISE
2010
15 years 1 months ago
2010
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
160
click to vote
CAISE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
201
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
142
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...