Sciweavers

583 search results - page 37 / 117
» Finding Answers to Complex Questions
Sort
View
ICMCS
2007
IEEE
79views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Pop Music Beat Detection in the Huffman Coded Domain
This paper presents a novel beat detector that operates in the Huffman coded domain of a MP3 audio bitstream. We seek to answer two main questions. First, whether it is possible t...
Jia Zhu, Ye Wang
TOC
2010
123views Management» more  TOC 2010»
13 years 4 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
Navin Goyal, Michael Saks
TAL
2010
Springer
13 years 8 months ago
Passage Retrieval in Log Files: An Approach Based on Query Enrichment
Abstract. The question answering systems are considered the next generation of search engines. This paper focuses on the first step of this process, which is to search for relevant...
Hassan Saneifar, Stéphane Bonniol, Anne Lau...
SIAMREV
2010
110views more  SIAMREV 2010»
13 years 4 months ago
Complex Singularities and the Lorenz Attractor
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematica...
Divakar Viswanath, Sönmez Sahutoglu
MST
2007
138views more  MST 2007»
13 years 9 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke