Sciweavers

316 search results - page 43 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
14 years 7 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu
WSC
2007
15 years 5 hour ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...
VLDB
2007
ACM
89views Database» more  VLDB 2007»
15 years 10 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind