1101 search results - page 130 / 221 » An Algorithm for the Graph Crossing Number Problem |
276
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
136
click to vote
SIGECOM
2006
ACM
15 years 11 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
135
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
118
Voted
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
141
click to vote
TMC
2008
15 years 5 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...