Sciweavers

690 search results - page 132 / 138
» Dense Admissible Sets
Sort
View
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
WAIM
2007
Springer
14 years 1 months ago
Improvements of HITS Algorithms for Spam Links
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
Yasuhito Asano, Yu Tezuka, Takao Nishizeki
MM
2005
ACM
160views Multimedia» more  MM 2005»
14 years 27 days ago
Putting active learning into multimedia applications: dynamic definition and refinement of concept classifiers
The authors developed an extensible system for video exploitation that puts the user in control to better accommodate novel situations and source material. Visually dense displays...
Ming-yu Chen, Michael G. Christel, Alexander G. Ha...
MOBICOM
2005
ACM
14 years 27 days ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
SASN
2004
ACM
14 years 23 days ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim