Sciweavers

3991 search results - page 212 / 799
» Bounding homogeneous models
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
TIT
2010
146views Education» more  TIT 2010»
13 years 3 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
14 years 1 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
ACL
2003
13 years 9 months ago
Parsing with Generative Models of Predicate-Argument Structure
The model used by the CCG parser of Hockenmaier and Steedman (2002b) would fail to capture the correct bilexical dependencies in a language with freer word order, such as Dutch. T...
Julia Hockenmaier
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 8 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...