Sciweavers

2137 search results - page 171 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 7 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
FOIKS
2008
Springer
15 years 8 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
Vasiliki Efstathiou, Anthony Hunter
ICCCN
2008
IEEE
16 years 24 days ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
Mingming Lu, Jie Wu
WWW
2008
ACM
16 years 7 months ago
Web graph similarity for anomaly detection (poster)
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...
RSA
2008
103views more  RSA 2008»
15 years 5 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav