661 search results - page 71 / 133 » Combining Information using Hard Constraints |
101
Voted
UIST
2006
ACM
15 years 6 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
89
Voted
GPCE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
105
Voted
CIVR
2008
Springer
15 years 2 months ago
2008
Springer
Past research on automatic laughter detection has focused mainly on audio-based detection. Here we present an audiovisual approach to distinguishing laughter from speech and we sh...
88
Voted
BMCBI
2008
15 years 19 days ago
2008
Background: Aligning homologous non-coding RNAs (ncRNAs) correctly in terms of sequence and structure is an unresolved problem, due to both mathematical complexity and imperfect s...
128
click to vote
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
Music information retrieval (MIR) holds great promise as a technology for managing large music archives. One of the key components of MIR that has been actively researched into is...