Sciweavers

4114 search results - page 115 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
145
Voted
MSOM
2008
103views more  MSOM 2008»
15 years 4 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 5 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
AI
2008
Springer
15 years 5 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
VLSISP
2011
358views Database» more  VLSISP 2011»
14 years 12 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...
173
Voted
SAC
2008
ACM
15 years 4 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng