Sciweavers

1149 search results - page 199 / 230
» Minimally non-Pfaffian graphs
Sort
View
SIGSOFT
2007
ACM
16 years 17 days ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 13 days ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 11 days ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
KDD
2002
ACM
286views Data Mining» more  KDD 2002»
16 years 6 days ago
Object Boundary Detection For Ontology-Based Image Classification
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential f...
Lei Wang, Latifur Khan, Casey Breen
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
16 years 6 days ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...