Sciweavers

963 search results - page 157 / 193
» On the decomposition of rational functions
Sort
View
DM
2010
103views more  DM 2010»
13 years 8 months ago
Degree-bounded factorizations of bipartite multigraphs and of pseudographs
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
Anthony J. W. Hilton
EAAI
2007
135views more  EAAI 2007»
13 years 8 months ago
Automatic generation of explanations: AGE
Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspec...
Silvia B. González-Brambila, Eduardo F. Mor...
TSP
2008
109views more  TSP 2008»
13 years 8 months ago
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
13 years 8 months ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz
PLDI
2011
ACM
12 years 11 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...