Sciweavers

2354 search results - page 289 / 471
» Radio number for trees
Sort
View
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 7 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish
ISCAS
2007
IEEE
96views Hardware» more  ISCAS 2007»
16 years 1 months ago
Novel High-Speed Redundant Binary to Binary converter using Prefix Networks
— Fast addition and multiplication are of paramount importance in many arithmetic circuits and processors. The use of redundant number system for efficient implementation of thes...
Sreehari Veeramachaneni, Kirthi M. Krishna, Lingam...
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
15 years 8 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
16 years 7 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...