Sciweavers

5056 search results - page 846 / 1012
» Network Coding Theory
Sort
View
CIKM
2005
Springer
16 years 19 hour ago
MailRank: using ranking for spam detection
Can we use social networks to combat spam? This paper investigates the feasibility of MailRank, a new email ranking and classification scheme exploiting the social communication ...
Paul-Alexandru Chirita, Jörg Diederich, Wolfg...
PDC
2004
ACM
15 years 12 months ago
From small scale to large scale user participation: a case study of participatory design in e-government systems
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...
Anne-Marie Oostveen, Peter Van den Besselaar
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 12 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 11 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
FLAIRS
2008
15 years 8 months ago
A First-Order Bayesian Tool for Probabilistic Ontologies
One of the major weaknesses of current research on the Semantic Web (SW) is the lack of proper means to represent and reason with uncertainty. A number of recent efforts from the ...
Paulo Cesar G. da Costa, Marcelo Ladeira, Rommel N...