6368 search results - page 1225 / 1274 » Modeling Problem Transformations based on Data Complexity |
104
click to vote
KAIS
2011
14 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
IWNAS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-...
120
Voted
SIGADA
2001
Springer
15 years 2 months ago
2001
Springer
Statement and AbstractProblem Statement and AbstractProblem Statement and AbstractProblem Statement and Abstract The U.S. Navy currently bases the majority of our contact managemen...
CGF
2010
14 years 10 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
106
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...