Sciweavers

4114 search results - page 470 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
EACL
2009
ACL Anthology
16 years 7 months ago
Translation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
Adam Lopez
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 7 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
SIGMOD
2004
ACM
143views Database» more  SIGMOD 2004»
16 years 7 months ago
Joining Interval Data in Relational Databases
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
Jost Enderle, Matthias Hampel, Thomas Seidl
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
16 years 7 days ago
Pattern Identification in Biogeography
—Identifying common patterns among area cladograms that arise in historical biogeography is an important tool for biogeographical inference. We develop the first rigorous formali...
Ganeshkumar Ganapathy, Barbara Goodson, Robert K. ...