Sciweavers

1728 search results - page 317 / 346
» The Accelerated Euclidean Algorithm
Sort
View
MMDB
2004
ACM
153views Multimedia» more  MMDB 2004»
15 years 3 months ago
A PCA-based similarity measure for multivariate time series
Multivariate time series (MTS) datasets are common in various multimedia, medical and financial applications. We propose a similarity measure for MTS datasets, Eros (Extended Fro...
Kiyoung Yang, Cyrus Shahabi
COMPGEOM
2003
ACM
15 years 2 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
FOCS
2002
IEEE
15 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
82
Voted
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
15 years 2 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...