Sciweavers

882 search results - page 4 / 177
» On self-embeddings of computable linear orderings
Sort
View
COLING
2010
13 years 2 months ago
Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
Hitoshi Nishikawa, Takaaki Hasegawa, Yoshihiro Mat...
DAC
2008
ACM
13 years 9 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
13 years 4 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy
CIE
2010
Springer
13 years 7 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 7 months ago
Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
Ralf Gollmer, Frederike Neise, Rüdiger Schult...