Sciweavers

539 search results - page 75 / 108
» Recurrence relations and fast algorithms
Sort
View
DOCENG
2008
ACM
15 years 2 months ago
Satisficing scrolls: a shortcut to satisfactory layout
We present at a new approach to finding aesthetically pleasing page layouts. We do not aim to find an optimal layout, rather the aim is to find a layout which is not obviously wro...
Nathan Hurst, Kim Marriott
126
Voted
MEDIAFORENSICS
2010
15 years 2 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
91
Voted
APJOR
2010
118views more  APJOR 2010»
14 years 11 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura
122
Voted
DLOG
2010
14 years 10 months ago
Generating Referring Expressions with OWL2
The task of generating referring expressions, an important subtask of Natural Language Generation is to generate phrases that uniquely identify domain entities. Until recently, man...
Yuan Ren, Kees van Deemter, Jeff Z. Pan
SRDS
2010
IEEE
14 years 10 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...