Sciweavers

139 search results - page 15 / 28
» Computing crossing numbers in quadratic time
Sort
View
WSC
1998
13 years 10 months ago
Toward Increased Use of Simulation in Transportation
The validity and usefulness of system simulation has been well-established for decades in areas such as computer and communications systems, general manufacturing systems, and mil...
Daniel T. Brunner, Gary Cross, Catherine McGhee, J...
IPPS
2007
IEEE
14 years 2 months ago
Speculative Flow Control for High-Radix Datacenter Interconnect Routers
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
Cyriel Minkenberg, Mitchell Gusat
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 9 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
GD
2006
Springer
14 years 8 days ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
MASCOTS
2000
13 years 10 months ago
Stateless Routing in Network Simulations
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
George F. Riley, Mostafa H. Ammar, Richard Fujimot...