Sciweavers

1545 search results - page 287 / 309
» On tree congestion of graphs
Sort
View
101
Voted
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 11 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
14 years 11 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
SERP
2004
14 years 11 months ago
Design and Evaluation of an Automated Aspect Mining Tool
Attention to aspect oriented programming (AOP) is rapidly growing as its benefits in large software system development and maintenance are increasingly recognized. However, existin...
David Shepherd, Emily Gibson, Lori L. Pollock
148
Voted
WAE
2001
281views Algorithms» more  WAE 2001»
14 years 11 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
93
Voted
NIPS
2003
14 years 11 months ago
Unsupervised Context Sensitive Language Acquisition from a Large Corpus
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
Zach Solan, David Horn, Eytan Ruppin, Shimon Edelm...