Sciweavers

4110 search results - page 217 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 6 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 10 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 8 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
ICML
2010
IEEE
15 years 4 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
ACL
1998
15 years 7 months ago
Part of Speech Tagging Using a Network of Linear Separators
We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separat...
Dan Roth, Dmitry Zelenko