Sciweavers

17018 search results - page 3300 / 3404
» From the How to the What
Sort
View
NIPS
2008
13 years 10 months ago
Semi-supervised Learning with Weakly-Related Unlabeled Data: Towards Better Text Categorization
The cluster assumption is exploited by most semi-supervised learning (SSL) methods. However, if the unlabeled data is merely weakly related to the target classes, it becomes quest...
Liu Yang, Rong Jin, Rahul Sukthankar
INTERACT
2007
13 years 10 months ago
Techniques for Interacting with Off-Screen Content
Many systems – such as map viewers or visual editors – provide a limited viewport onto a larger graphical workspace. The limited viewport means that users often have to navigat...
Pourang Irani, Carl Gutwin, Grant Partridge, Mahta...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 10 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
SPLC
2008
13 years 10 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
RIVF
2007
13 years 10 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
« Prev « First page 3300 / 3404 Last » Next »