Sciweavers

285 search results - page 50 / 57
» Dynamic Symbolic Execution for Testing Distributed Objects
Sort
View
121
Voted
ECCV
2010
Springer
15 years 4 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
PASTE
2010
ACM
15 years 4 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
VRCAI
2004
ACM
15 years 5 months ago
Explorative construction of virtual worlds: an interactive kernel approach
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...
Jinseok Seo, Gerard Jounghyun Kim
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 5 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
TON
2010
157views more  TON 2010»
14 years 6 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle