Sciweavers

152 search results - page 29 / 31
» Sorting by reversals is difficult
Sort
View
ECLIPSE
2006
ACM
14 years 1 months ago
Lighthouse: coordination through emerging design
Despite the fact that software development is an inherently collaborative activity, a great deal of software development is spent with developers in isolation, working on their ow...
Isabella A. da Silva, Ping Chen, Christopher van d...
MSR
2006
ACM
14 years 1 months ago
TA-RE: an exchange language for mining software repositories
Software repositories have been getting a lot of attention from researchers in recent years. In order to analyze software repositories, it is necessary to first extract raw data f...
Sunghun Kim, Thomas Zimmermann, Miryung Kim, Ahmed...
CASES
2004
ACM
14 years 27 days ago
Hardware assisted control flow obfuscation for embedded processors
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...
Xiaotong Zhuang, Tao Zhang, Hsien-Hsin S. Lee, San...
ASPLOS
1994
ACM
13 years 11 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant