Sciweavers

531 search results - page 9 / 107
» A Better Algorithm for Random k-SAT
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 11 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
CIKM
2009
Springer
14 years 2 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
AI
2002
Springer
13 years 7 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang
MSWIM
2005
ACM
14 years 1 months ago
Topology control with better radio models: implications for energy and multi-hop interference
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph....
Douglas M. Blough, Mauro Leoncini, Giovanni Resta,...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...