Sciweavers

1330 search results - page 133 / 266
» No Classic Boundary Conditions
Sort
View
150
Voted
ECEASST
2008
91views more  ECEASST 2008»
15 years 7 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
15 years 7 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
201
Voted
HEURISTICS
2006
109views more  HEURISTICS 2006»
15 years 7 months ago
A scatter search algorithm for project scheduling under partially renewable resources
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be view...
Ramón Alvarez-Valdés, Enric Crespo, ...
ICASSP
2011
IEEE
14 years 10 months ago
Sparse spectral factorization: Unicity and reconstruction algorithms
Spectral factorization is a classical tool in signal processing and communications. It also plays a critical role in X-ray crystallography, in the context of phase retrieval. In t...
Yue M. Lu, Martin Vetterli
219
Voted
AI
2011
Springer
14 years 10 months ago
Exploiting Conversational Features to Detect High-Quality Blog Comments
Abstract. In this work, we present a method for classifying the quality of blog comments using Linear-Chain Conditional Random Fields (CRFs). This approach is found to yield high a...
Nicholas FitzGerald, Giuseppe Carenini, Gabriel Mu...