Sciweavers

728 search results - page 75 / 146
» Compressing combinatorial objects
Sort
View
ICMCS
2010
IEEE
139views Multimedia» more  ICMCS 2010»
15 years 3 months ago
LyDAR: A LYrics Density based Approach to non-homogeneous music Resizing
In many scenarios, such as TV/radio advertising production, animation production, and presentation, music pieces are constrained in the metric of time. For example, an editor want...
Zhang Liu, Chaokun Wang, Lu Guo, Yiyuan Bai, Jianm...
121
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 2 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
208
Voted
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 3 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
129
Voted
CRV
2006
IEEE
187views Robotics» more  CRV 2006»
15 years 6 months ago
Confidence Based updation of Motion Conspicuity in Dynamic Scenes
Computational models of visual attention result in considerable data compression by eliminating processing on regions likely to be devoid of meaningful content. While saliency map...
Vivek Kumar Singh, Subhransu Maji, Amitabha Mukerj...
118
Voted
COCOA
2009
Springer
15 years 8 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...