Sciweavers

18306 search results - page 484 / 3662
» Algorithmics in Exponential Time
Sort
View
DLT
2010
15 years 9 months ago
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
Alexander Okhotin
TIT
2008
103views more  TIT 2008»
15 years 7 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
16 years 1 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 7 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
DATE
2000
IEEE
89views Hardware» more  DATE 2000»
16 years 10 hour ago
A System-Level Synthesis Algorithm with Guaranteed Solution Quality
Recently a number of heuristic based system-level synthesis algorithms have been proposed. Though these algorithms quickly generate good solutions, how close these solutions are t...
U. Nagaraj Shenoy, Prithviraj Banerjee, Alok N. Ch...