Sciweavers

2374 search results - page 71 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
PVLDB
2010
93views more  PVLDB 2010»
13 years 8 months ago
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation
The goal of a threshold query is to detect all objects whose score exceeds a given threshold. This type of query is used in many settings, such as data mining, event triggering, a...
Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Sch...
SPAA
1998
ACM
14 years 2 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ICCV
2003
IEEE
15 years 3 days ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 10 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
VLSID
2007
IEEE
154views VLSI» more  VLSID 2007»
14 years 10 months ago
Application Specific Datapath Extension with Distributed I/O Functional Units
Performance of an application can be improved through augmenting the processor with Application specific Functional Units (AFUs). Usually a cluster of operations identified from th...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul