Sciweavers

2304 search results - page 206 / 461
» On the Vulnerability of Large Graphs
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
15 years 4 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
PIMRC
2010
IEEE
15 years 4 months ago
Frame delay distribution analysis of IEEE 802.11 networks using Signal Flow Graphs
Frame delay variance in CSMA/CA networks is large. Wireless applications may require both, limited mean delay and limited delay jitter. These parameters can be derived easily from ...
Ralf Jennen, Sebastian Max, Bernhard Walke
CIKM
2011
Springer
14 years 6 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
16 years 8 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...