Sciweavers

4865 search results - page 142 / 973
» The Complexity of Graph Connectivity
Sort
View
CHI
2010
ACM
14 years 5 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
FOCS
2007
IEEE
14 years 5 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
EDBT
2006
ACM
116views Database» more  EDBT 2006»
14 years 11 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
SOFSEM
2009
Springer
14 years 7 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
ESANN
2004
14 years 5 days ago
Reducing connectivity by using cortical modular bands
The way information is represented and processed in a neural network may have important consequences on its computational power and complexity. Basically, information representatio...
Julien Vitay, Nicolas P. Rougier, Fréd&eacu...