Sciweavers

95 search results - page 10 / 19
» Filling and slotting: analysis and algorithms
Sort
View
CGF
2006
122views more  CGF 2006»
13 years 7 months ago
Stroke Pattern Analysis and Synthesis
We present a synthesis technique that can automatically generate stroke patterns based on a user-specified reference pattern. Our method is an extension of texture synthesis techn...
Pascal Barla, Simon Breslav, Joëlle Thollot, ...
FOCS
1998
IEEE
13 years 11 months ago
Jitter Control in QoS Networks
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
Yishay Mansour, Boaz Patt-Shamir
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 7 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
TMC
2010
141views more  TMC 2010»
13 years 6 months ago
Energy-Optimal Scheduling with Dynamic Channel Acquisition in Wireless Downlinks
—We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state informatio...
Chih-Ping Li, Michael J. Neely
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen