Sciweavers

901 search results - page 131 / 181
» Analyzing linear mergers
Sort
View
NIPS
2007
15 years 10 days ago
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
Jieping Ye, Zheng Zhao, Mingrui Wu
75
Voted
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 10 days ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
113
Voted
PLANX
2007
15 years 10 days ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
AAAI
2006
15 years 10 days ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
AIPS
2006
15 years 9 days ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith