Sciweavers

3220 search results - page 336 / 644
» Constrained Graph Processes
Sort
View
WSC
2004
15 years 8 months ago
Approximating Component Selection
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
Michael Roy Fox, David C. Brogan, Paul F. Reynolds...
EGOV
2010
Springer
15 years 7 months ago
From Policy-Making Statements to First-Order Logic
Within a framework for enriched on-line discussion forums for e-government policy-making, pro and con statements for positions are input, structurally related, then logically repre...
Adam Wyner, Tom M. van Engers, Kiavash Bahreini
ICASSP
2010
IEEE
15 years 6 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
TASLP
2008
126views more  TASLP 2008»
15 years 6 months ago
LyricAlly: Automatic Synchronization of Textual Lyrics to Acoustic Music Signals
We present LyricAlly, a prototype that automatically aligns acoustic musical signals with their corresponding textual lyrics, in a manner similar to manually-aligned karaoke. We ta...
Min-Yen Kan, Ye Wang, Denny Iskandar, Tin Lay Nwe,...
ISCI
2010
211views more  ISCI 2010»
15 years 5 months ago
A new heuristic approach for non-convex optimization problems
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
Rosario Toscano, Patrick Lyonnet