Sciweavers

2127 search results - page 288 / 426
» Computing large matchings fast
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Subsequence similarity language models
In this work we present the Subsequence Similarity Language Model (S2-LM) which is a new approach to language modeling based on string similarity. As a language model, S2-LM gener...
Juan M. Huerta
ICASSP
2011
IEEE
14 years 7 months ago
Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
CVPR
2009
IEEE
16 years 11 months ago
Locally Constrained Diffusion Process on Locally Densified Distance Spaces with Applications to Shape Retrieval
The matching and retrieval of 2D shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed, with the main focus bein...
Xingwei Yang (Temple University), Suzan Koknar-Tez...
IPPS
2007
IEEE
15 years 10 months ago
Design Alternatives for a High-Performance Self-Securing Ethernet Network Interface
This paper presents and evaluates a strategy for integrating the Snort network intrusion detection system into a high-performance programmable Ethernet network interface card (NIC...
Derek L. Schuff, Vijay S. Pai
DEBS
2011
ACM
14 years 7 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke