1115 search results - page 92 / 223 » Separating Shape Graphs |
89
Voted
NOLISP
2005
Springer
15 years 8 months ago
2005
Springer
This presentation concerns the simulation of disordered voices. The synthesis is based on shaping functions, which are nonlinear memoryless inputoutput characteristics that transfo...
135
Voted
VLSM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we propose a novel variational technique for the knowledge based segmentation of two dimensional objects. One of the elements of our approach is the use of ...
124
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
159
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
93
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...