Sciweavers

1489 search results - page 96 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
JAR
2006
236views more  JAR 2006»
14 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
14 years 7 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
CLOUD
2010
ACM
15 years 3 months ago
Towards automatic optimization of MapReduce programs
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
Shivnath Babu
BMVC
2010
14 years 8 months ago
Real-time Action Recognition by Spatiotemporal Semantic and Structural Forests
Whereas most existing action recognition methods require computationally demanding feature extraction and/or classification, this paper presents a novel real-time solution that ut...
Tsz-Ho Yu, Tae-Kyun Kim, Roberto Cipolla
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg