Sciweavers

1133 search results - page 221 / 227
» Basics of Graph Cuts
Sort
View
WIOPT
2005
IEEE
14 years 1 months ago
A New Relaying Scheme for Cheap Wireless Relay Nodes
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
Ramin Khalili, Kavé Salamatian
CIKM
2005
Springer
14 years 1 months 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...
WG
2005
Springer
14 years 1 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 29 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
14 years 26 days ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...