Sciweavers

373 search results - page 13 / 75
» Counting in Trees for Free
Sort
View
DAC
2006
ACM
14 years 9 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 8 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
EMNLP
2009
13 years 6 months ago
A Comparison of Model Free versus Model Intensive Approaches to Sentence Compression
This work introduces a model free approach to sentence compression, which grew out of ideas from Nomoto (2008), and examines how it compares to a state-of-art model intensive appr...
Tadashi Nomoto
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...