Sciweavers

372 search results - page 16 / 75
» On Finding Small 2-Generating Sets
Sort
View
COCOA
2008
Springer
14 years 11 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
JCIT
2008
138views more  JCIT 2008»
14 years 9 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
100
Voted
AIRWEB
2007
Springer
15 years 3 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
BMCBI
2004
117views more  BMCBI 2004»
14 years 9 months ago
Cancer characterization and feature set extraction by discriminative margin clustering
Background: A central challenge in the molecular diagnosis and treatment of cancer is to define a set of molecular features that, taken together, distinguish a given cancer, or ty...
Kamesh Munagala, Robert Tibshirani, Patrick O. Bro...
76
Voted
ICML
2004
IEEE
15 years 10 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik