Sciweavers

37 search results - page 6 / 8
» What is the furthest graph from a hereditary property
Sort
View
CORR
2007
Springer
129views Education» more  CORR 2007»
13 years 6 months ago
A Tutorial on Spectral Clustering
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
Ulrike von Luxburg
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 5 months ago
Spectrum Sharing as Spatial Congestion Games
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
Sahand Haji Ali Ahmad, Cem Tekin, Mingyan Liu, Ric...
CAV
2010
Springer
161views Hardware» more  CAV 2010»
13 years 10 months ago
Directed Proof Generation for Machine Code
We present the algorithms used in MCVETO (Machine-Code VErification TOol), a tool to check whether a stripped machinecode program satisfies a safety property. The verification p...
Aditya V. Thakur, Junghee Lim, Akash Lal, Amanda B...
ECCC
2006
88views more  ECCC 2006»
13 years 6 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
WWW
2004
ACM
14 years 7 months ago
A proposal for an owl rules language
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...
Ian Horrocks, Peter F. Patel-Schneider