Sciweavers

6110 search results - page 959 / 1222
» Approximate Computing
Sort
View
ICIP
2006
IEEE
16 years 8 months ago
Using Non-Parametric Kernel to Segment and Smooth Images Simultaneously
Piecewise constant and piecewise smooth Mumford-Shah (MS) models have been widely studied and used for image segmentation. More complicated than piecewise constant MS, global Gaus...
Weihong Guo, Yunmei Chen
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
16 years 8 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
ICML
2008
IEEE
16 years 7 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
EOR
2007
96views more  EOR 2007»
15 years 6 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
TCOM
2011
92views more  TCOM 2011»
15 years 1 months ago
Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics
Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the ...
Trung Thanh Nguyen 0001, Lutz H.-J. Lampe