Sciweavers

9284 search results - page 1781 / 1857
» Knowledge State Algorithms
Sort
View
ICTIR
2009
Springer
15 years 3 months ago
An Effective Approach to Verbose Queries Using a Limited Dependencies Language Model
Intuitively, any `bag of words' approach in IR should benefit from taking term dependencies into account. Unfortunately, for years the results of exploiting such dependencies ...
Eduard Hoenkamp, Peter Bruza, Dawei Song, Qiang Hu...
CVPR
2011
IEEE
15 years 1 months ago
action recognition by dense trajectories
Feature trajectories have shown to be efficient for representing videos. Typically, they are extracted using the KLT tracker or matching SIFT descriptors between frames. However,...
Heng Wang, Alexander Kläser, Cordelia Schmid, Che...
ECCC
2011
207views ECommerce» more  ECCC 2011»
15 years 1 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
DAC
2010
ACM
15 years 1 months ago
Node addition and removal in the presence of don't cares
This paper presents a logic restructuring technique named node addition and removal (NAR). It works by adding a node into a circuit to replace an existing node and then removing t...
Yung-Chih Chen, Chun-Yao Wang
WWW
2011
ACM
15 years 1 months ago
Second international workshop on RESTful design (WS-REST 2011)
Over the past few years, the discussion between the two major architectural styles for designing and implementing Web services, the RPC-oriented approach and the resourceoriented ...
Cesare Pautasso, Erik Wilde, Rosa Alarcón
« Prev « First page 1781 / 1857 Last » Next »