Sciweavers

339 search results - page 48 / 68
» Handling dynamic data structures in search based testing
Sort
View
CVPR
2009
IEEE
14 years 28 days ago
Keypoint induced distance profiles for visual recognition
We show that histograms of keypoint descriptor distances can make useful features for visual recognition. Descriptor distances are often exhaustively computed between sets of keyp...
Tat-Jun Chin, David Suter
GECCO
2007
Springer
217views Optimization» more  GECCO 2007»
13 years 10 months ago
A quantitative analysis of memory requirement and generalization performance for robotic tasks
In autonomous agent systems, memory is an important element to handle agent behaviors appropriately. We present the analysis of memory requirements for robotic tasks including wal...
DaeEun Kim
ICDE
2006
IEEE
112views Database» more  ICDE 2006»
14 years 10 months ago
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
Ashraf Aboulnaga, Ihab F. Ilyas, M. Tamer Özs...
DAC
2005
ACM
14 years 10 months ago
Simulation based deadlock analysis for system level designs
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
Xi Chen, Abhijit Davare, Harry Hsieh, Alberto L. S...
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 1 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...