Sciweavers

2435 search results - page 299 / 487
» Question Answering in Webclopedia
Sort
View
SPE
2002
115views more  SPE 2002»
15 years 6 months ago
D'Agents: Applications and performance of a mobile-agent system
D'Agents is a general-purpose mobile-agent system that has been used in several informationretrieval applications. In this paper, we first examine one such application, opera...
Robert S. Gray, George Cybenko, David Kotz, Ronald...
TCS
2002
15 years 6 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
MST
2007
138views more  MST 2007»
15 years 6 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 5 months ago
Spectral methods for the detection of network community structure: a comparative analysis
Spectral analysis has been successfully applied to the detection of community structure of networks, respectively being based on the adjacency matrix, the standard Laplacian matrix...
Hua-Wei Shen, Xue-Qi Cheng
ECCC
2010
106views more  ECCC 2010»
15 years 5 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria