Sciweavers

1007 search results - page 58 / 202
» The Complexity of Futile Questioning
Sort
View
80
Voted
ICMCS
2007
IEEE
79views Multimedia» more  ICMCS 2007»
15 years 10 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
FUN
2007
Springer
78views Algorithms» more  FUN 2007»
15 years 10 months ago
Wooden Geometric Puzzles: Design and Hardness Proofs
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
99
Voted
ERSHOV
2003
Springer
15 years 9 months ago
The Translation Power of the Futamura Projections
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
Robert Glück
VLDB
1999
ACM
107views Database» more  VLDB 1999»
15 years 8 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
148
Voted
CSMR
2004
IEEE
15 years 7 months ago
Legacy Software Evaluation Model for Outsourced Maintainer
Outsourcing has become common practice in the software industry. Organizations routinely subcontract the maintenance of their software assets to specialized companies. A great cha...
Cristiane S. Ramos, Káthia Marçal de...