Sciweavers

397 search results - page 76 / 80
» Comparing Two Grammar-Based Generation Algorithms: A Case St...
Sort
View
ICDM
2006
IEEE
100views Data Mining» more  ICDM 2006»
14 years 1 months ago
Meta Clustering
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
Rich Caruana, Mohamed Farid Elhawary, Nam Nguyen, ...
ICSE
2010
IEEE-ACM
13 years 5 months ago
Identifying crosscutting concerns using historical code changes
Detailed knowledge about implemented concerns in the source code is crucial for the cost-effective maintenance and successful evolution of large systems. Concern mining techniques...
Bram Adams, Zhen Ming Jiang, Ahmed E. Hassan
WISE
2007
Springer
14 years 1 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
BMCBI
2010
116views more  BMCBI 2010»
13 years 7 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
ECCC
2011
207views ECommerce» more  ECCC 2011»
13 years 2 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...