Sciweavers

21319 search results - page 4263 / 4264
» An Approach for Method Reengineering
Sort
View
WWW
2003
ACM
14 years 10 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
STACS
2010
Springer
14 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
CCS
2007
ACM
14 years 4 months ago
Filtering spam with behavioral blacklisting
Spam filters often use the reputation of an IP address (or IP address range) to classify email senders. This approach worked well when most spam originated from senders with fix...
Anirudh Ramachandran, Nick Feamster, Santosh Vempa...
VAMOS
2007
Springer
14 years 3 months ago
A Plea for Help with Variability, in Two Acts
A short theatrical exaggeration (but not too much) which describes practical problems with variability as experienced by real-world software developers. Real issue, there are no p...
Reed Little, Randy Blohm
DIMACS
1996
13 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
« Prev « First page 4263 / 4264 Last » Next »