Sciweavers

554 search results - page 110 / 111
» Approximate Probabilistic Model Checking
Sort
View
TSD
2007
Springer
13 years 12 months ago
Using Query-Relevant Documents Pairs for Cross-Lingual Information Retrieval
The world wide web is a natural setting for cross-lingual information retrieval. The European Union is a typical example of a multilingual scenario, where multiple users have to de...
David Pinto, Alfons Juan, Paolo Rosso
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
13 years 11 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
13 years 11 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
SASN
2003
ACM
13 years 11 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
13 years 10 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou