Sciweavers

736 search results - page 42 / 148
» Distinguishing geometric graphs
Sort
View
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
15 years 6 months ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
CG
2002
Springer
15 years 1 months ago
Surface simplification using a discrete curvature norm
This paper proposes a mesh simplification algorithm using a discrete curvature norm. Most of the simplification algorithms are using a distance metric to date. The distance metric...
Sun-Jeong Kim, Chang-Hun Kim, David Levin
MOBIHOC
2008
ACM
16 years 1 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
DAGSTUHL
2001
15 years 3 months ago
Visualization for the Mind's Eye
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
Nelson A. Baloian, Wolfram Luther
ICML
2009
IEEE
16 years 2 months ago
Multi-instance learning by treating instances as non-I.I.D. samples
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
Zhi-Hua Zhou, Yu-Yin Sun, Yu-Feng Li