Sciweavers

7129 search results - page 799 / 1426
» Approximation Algorithms for Treewidth
Sort
View
NPAR
2010
ACM
15 years 11 months ago
Stylized depiction of images based on depth perception
Recent works in image editing are opening up new possibilities to manipulate and enhance input images. Within this context, we leverage well-known characteristics of human percept...
Jorge Lopez-Moreno, Jorge Jimenez, Sunil Hadap, Er...
STACS
2001
Springer
15 years 11 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 10 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
FSTTCS
1993
Springer
15 years 10 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
ISMIR
2000
Springer
176views Music» more  ISMIR 2000»
15 years 10 months ago
SEMEX - An efficient Music Retrieval Prototype
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
Kjell Lemström, S. Perttu