Sciweavers

10907 search results - page 1906 / 2182
» Constraint Based Strategies
Sort
View
NIPS
2008
15 years 8 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
NIPS
2008
15 years 8 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
OPODIS
2008
15 years 8 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel
PLANX
2008
15 years 8 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
15 years 8 months ago
Large-Scale Many-Class Learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Michael Connor
« Prev « First page 1906 / 2182 Last » Next »