Sciweavers

2252 search results - page 307 / 451
» Improving Random Forests
Sort
View
WINET
2010
136views more  WINET 2010»
13 years 9 months ago
Analysis of the Bluetooth device discovery protocol
Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes f...
Goutam Chakraborty, Kshirasagar Naik, Debasish Cha...
ECCC
2011
204views ECommerce» more  ECCC 2011»
13 years 2 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 11 months ago
Advances in flash memory SSD technology for enterprise database applications
The past few decades have witnessed a chronic and widening imbalance among processor bandwidth, disk capacity, and access speed of disk. According to Amdhal's law, the perfor...
Sang-Won Lee, Bongki Moon, Chanik Park
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 8 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
CIKM
2009
Springer
14 years 5 months ago
Helping editors choose better seed sets for entity set expansion
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised exp...
Vishnu Vyas, Patrick Pantel, Eric Crestan