Sciweavers

478 search results - page 78 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ICCAD
2005
IEEE
94views Hardware» more  ICCAD 2005»
14 years 4 months ago
Post-placement voltage island generation under performance requirement
High power consumption not only leads to short battery life for handheld devices, but also causes on-chip thermal and reliability problems in general. As power consumption is prop...
Huaizhi Wu, I-Min Liu, Martin D. F. Wong, Yusu Wan...
NIPS
2007
13 years 9 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
PVLDB
2008
77views more  PVLDB 2008»
13 years 7 months ago
Efficient network aware search in collaborative tagging sites
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lak...
INFOCOM
2010
IEEE
13 years 6 months ago
Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks
—In-network aggregation has become a promising technique for improving the energy efficiency of wireless sensor networks. Aggregating data at various nodes in the network result...
Changhee Joo, Jin-Ghoo Choi, Ness B. Shroff
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 9 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter