182 search results - page 28 / 37 » A Theory of Strict P-completeness |
WWW
2009
ACM
14 years 2 months ago
2009
ACM
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
Automated trust negotiation is an approach which establishes trust between strangers through the bilateral, iterative disclosure of digital credentials. Sensitive credentials are ...
MOBICOM
2004
ACM
14 years 1 months ago
2004
ACM
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more su...