Sciweavers

478 search results - page 43 / 96
» Context-Sensitive Dependency Pairs
Sort
View
NIPS
2001
15 years 1 months ago
Probabilistic principles in unsupervised learning of visual structure: human data and a model
To find out how the representations of structured visual objects depend on the co-occurrence statistics of their constituents, we exposed subjects to a set of composite images wit...
Shimon Edelman, Benjamin P. Hiles, Hwajin Yang, Na...
ICASSP
2010
IEEE
15 years 21 hour ago
Tracking encrypted VoIP calls via robust hashing of network flows
In this work we propose a Voice over IP (VoIP) call tracking scheme based on robust hashing of VoIP flows. In the proposed scheme the audio content of a possibly encrypted VoIP ï...
Baris Coskun, Nasir D. Memon
BMCBI
2007
107views more  BMCBI 2007»
14 years 12 months ago
Progressive multiple sequence alignments from triplets
Motivation: The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step c...
Matthias Kruspe, Peter F. Stadler
CCR
2006
112views more  CCR 2006»
14 years 12 months ago
The probe gap model can underestimate the available bandwidth of multihop paths
The Probe Gap Model (PGM) was proposed as a lightweight and fast available bandwidth estimation method. Measurement tools such as Delphi and Spruce are based on PGM. Compared to e...
Li Lao, Constantine Dovrolis, M. Y. Sanadidi
ORDER
2008
61views more  ORDER 2008»
14 years 11 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel