Sciweavers

118 search results - page 19 / 24
» Complexity Cores and Hard Problem Instances
Sort
View
SIGSOFT
2009
ACM
14 years 8 months ago
DebugAdvisor: a recommender system for debugging
In large software development projects, when a programmer is assigned a bug to fix, she typically spends a lot of time searching (in an ad-hoc manner) for instances from the past ...
B. Ashok, Joseph M. Joy, Hongkang Liang, Sriram K....
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
13 years 11 months ago
Fair watermarking techniques
Many intellectual property protection (IPP) techniques have been proposed. Their primary objectives are providing convincible proof of authorship with least degradation of the qua...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
IRI
2007
IEEE
14 years 1 months ago
ModelML: a Markup Language for Automatic Model Synthesis
Domain-specific modeling has become a popular way of designing and developing systems. It generally involves a systematic use of a set of object-oriented models to represent vari...
Cong Zhang, Amol Bakshi, Viktor K. Prasanna
ILP
2003
Springer
14 years 16 days ago
Relational IBL in Music with a New Structural Similarity Measure
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
Asmir Tobudic, Gerhard Widmer
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...