Sciweavers

7886 search results - page 5 / 1578
» An evaluation of bipartitioning techniques
Sort
View
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
14 years 2 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
14 years 1 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
ICWS
2007
IEEE
13 years 10 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 11 months ago
Robust Reputation-Based Ranking on Bipartite Rating Networks
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 9 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy