Sciweavers

438 search results - page 46 / 88
» The forest hiding problem
Sort
View
ACL
2010
14 years 10 months ago
Growing Related Words from Seed via User Behaviors: A Re-Ranking Based Approach
Motivated by Google Sets, we study the problem of growing related words from a single seed word by leveraging user behaviors hiding in user records of Chinese input method. Our pr...
Yabin Zheng, Zhiyuan Liu, Lixing Xie
LPAR
2010
Springer
14 years 9 months ago
Hardness of Preorder Checking for Basic Formalisms
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
Laura Bozzelli, Axel Legay, Sophie Pinchinat
MASS
2010
181views Communications» more  MASS 2010»
14 years 9 months ago
Perfectly anonymous data aggregation in wireless sensor networks
Clustering and data aggregation in wireless sensor networks improves scalability, and helps the efficient use of scarce resources. Yet, these mechanisms also introduce some securi...
Levente Buttyán, Tamás Holczer
IMCSIT
2010
14 years 6 months ago
Multi-level Parallelization with Parallel Computational Services in BeesyCluster
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...
Pawel Czarnul
CVPR
2008
IEEE
16 years 1 months ago
Randomized trees for human pose detection
This paper addresses human pose recognition from video sequences by formulating it as a classification problem. Unlike much previous work we do not make any assumptions on the ava...
Grégory Rogez, Jonathan Rihan, Srikumar Ram...