Sciweavers

2223 search results - page 143 / 445
» Multimedia structuring using trees
Sort
View
96
Voted
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 6 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
ICCV
2011
IEEE
14 years 23 days ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
70
Voted
NIME
2004
Springer
114views Music» more  NIME 2004»
15 years 6 months ago
Tree Music: Composing with GAIA
In this report, we discuss Tree Music, an interactive computer music installation created using GAIA (Graphical Audio Interface Application), a new open-source interface for contr...
Judith Shatin, David Topper
100
Voted
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 1 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
15 years 10 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson