Sciweavers

1964 search results - page 263 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
SC
2009
ACM
14 years 3 months ago
Enabling high-fidelity neutron transport simulations on petascale architectures
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
Dinesh K. Kaushik, Micheal Smith, Allan Wollaber, ...
ASIAMS
2007
IEEE
14 years 2 months ago
Rough-Fuzzy Granulation, Rough Entropy and Image Segmentation
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
Sankar K. Pal
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 6 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
JAIR
2007
146views more  JAIR 2007»
13 years 8 months ago
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....