Sciweavers

109 search results - page 7 / 22
» Fast Prefix Search in Little Space, with Applications
Sort
View
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
14 years 23 days ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
JAIR
2006
74views more  JAIR 2006»
13 years 8 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
ICPP
2005
IEEE
14 years 2 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
ERCIMDL
2004
Springer
180views Education» more  ERCIMDL 2004»
14 years 1 months ago
Next Generation Search Interfaces - Interactive Data Exploration and Hypothesis Formulation
To date, the majority of Web search engines have provided simple keyword search interfaces that present the results as a ranked list of hyperlinks. More recently researchers have b...
Jane Hunter, Katya Falkovych, Suzanne Little