Sciweavers

926 search results - page 7 / 186
» Algorithms on Ideal over Complex Multiplication order
Sort
View
SPAA
2006
ACM
15 years 3 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
ICML
2009
IEEE
15 years 10 months ago
Partial order embedding with multiple kernels
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
Brian McFee, Gert R. G. Lanckriet
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 2 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
15 years 10 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
71
Voted
AVI
2004
14 years 11 months ago
A graph-based interface to complex hypermedia structure visualization
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
Manuel Freire, Pilar Rodríguez