Sciweavers

4009 search results - page 152 / 802
» Clustering on Complex Graphs
Sort
View
ICCCN
2007
IEEE
15 years 7 months ago
Scalable Peer-to-Peer File Sharing with Efficient Complex Query Support
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
Yan Li, Jyoti Ahuja, Li Lao, Jun-Hong Cui
134
Voted
TSMC
2002
110views more  TSMC 2002»
15 years 3 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
BPM
2006
Springer
166views Business» more  BPM 2006»
15 years 7 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
ECAL
2001
Springer
15 years 8 months ago
Taxonomy in Alife. Measures of Similarity for Complex Artificial Organisms
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
Maciej Komosinski, Marek Kubiak
SECURWARE
2008
IEEE
15 years 10 months ago
Optimal Trust Network Analysis with Subjective Logic
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
Audun Jøsang, Touhid Bhuiyan