Sciweavers

762 search results - page 6 / 153
» Finding Facilities Fast
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 6 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
16 years 19 hour ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
SIGIR
2006
ACM
15 years 12 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
FOCS
1998
IEEE
15 years 10 months ago
Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
Alan M. Frieze, Ravi Kannan, Santosh Vempala
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...