Sciweavers

3146 search results - page 60 / 630
» Efficient Consequence Finding
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
DCC
2005
IEEE
14 years 9 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
NIPS
2008
13 years 11 months ago
An Efficient Sequential Monte Carlo Algorithm for Coalescent Clustering
We propose an efficient sequential Monte Carlo inference scheme for the recently proposed coalescent clustering model [1]. Our algorithm has a quadratic runtime while those in [1]...
Dilan Görür, Yee Whye Teh
ICPR
2010
IEEE
13 years 7 months ago
Beyond "Near Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
ICOIN
2004
Springer
14 years 3 months ago
Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm
In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively rein...
Jae Seuk Oh, Sung-il Bae, Jin-Ho Ahn, Sungho Kang