Sciweavers

34170 search results - page 6604 / 6834
» Optimization
Sort
View
155
Voted
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 5 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
AAAI
2000
15 years 5 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
141
Voted
AIPS
2000
15 years 5 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
145
Voted
ACL
1998
15 years 5 months ago
Machine Translation with a Stochastic Grammatical Channel
We introduce a stochastic grammatical channel model for machine translation, that synthesizes several desirable characteristics of both statistical and grammatical machine transla...
Dekai Wu, Hongsing Wong
133
Voted
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
15 years 5 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
« Prev « First page 6604 / 6834 Last » Next »