Sciweavers

60 search results - page 9 / 12
» Context-Aware Object Connection Discovery in Large Graphs
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 9 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
IJCV
2006
299views more  IJCV 2006»
13 years 8 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
AIIA
2005
Springer
14 years 2 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
DEBU
2010
180views more  DEBU 2010»
13 years 8 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
DSN
2006
IEEE
14 years 6 days ago
Using Attack Injection to Discover New Vulnerabilities
Due to our increasing reliance on computer systems, security incidents and their causes are important problems that need to be addressed. To contribute to this objective, the pape...
Nuno Ferreira Neves, João Antunes, Miguel C...