194 search results - page 37 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
96
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
130
click to vote
MOBIHOC
2002
ACM
16 years 1 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
121
click to vote
WWW
2006
ACM
16 years 1 months ago
2006
ACM
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
126
click to vote
IJCNN
2000
IEEE
15 years 4 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...