Sciweavers

19866 search results - page 200 / 3974
» Computing all factorizations in ***
Sort
View
JGT
2007
99views more  JGT 2007»
15 years 6 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
NAACL
2010
15 years 4 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
VLSID
2006
IEEE
150views VLSI» more  VLSID 2006»
16 years 7 months ago
A Comprehensive SoC Design Methodology for Nanometer Design Challenges
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
R. Raghavendra Kumar, Ricky Bedi, Ramadas Rajagopa...
FOCS
2010
IEEE
15 years 4 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
SIGGRAPH
1994
ACM
15 years 10 months ago
A framework for the analysis of error in global illumination algorithms
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
James Arvo, Kenneth E. Torrance, Brian E. Smits