Sciweavers

583 search results - page 116 / 117
» On small blocking sets and their linearity
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
VISUALIZATION
1991
IEEE
13 years 11 months ago
A Tool for Visualizing the Topology of Three-Dimensional Vector Fields
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
Al Globus, C. Levit, T. Lasinski
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 11 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 9 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 8 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta