Sciweavers

2314 search results - page 156 / 463
» Minimal Partitions of a Graph
Sort
View
JCO
2006
126views more  JCO 2006»
15 years 3 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
SEMWEB
2001
Springer
15 years 8 months ago
On the Integration of Topic Maps and RDF data
Abstract. Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation of model-based data on the web. Each para...
Martin S. Lacher, Stefan Decker
COMBINATORICA
2010
14 years 11 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
SPAA
1997
ACM
15 years 8 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
133
Voted
ICML
2008
IEEE
16 years 4 months ago
Cost-sensitive multi-class classification from probability estimates
For two-class classification, it is common to classify by setting a threshold on class probability estimates, where the threshold is determined by ROC curve analysis. An analog fo...
Deirdre B. O'Brien, Maya R. Gupta, Robert M. Gray