2877 search results - page 371 / 576 » The Complexity of Planarity Testing |
262
Voted
ECOOP
2009
Springer
16 years 5 months ago
2009
Springer
Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this ...
153
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
125
click to vote
RECOMB
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
137
click to vote
CHI
2009
ACM
16 years 5 months ago
2009
ACM
Context-aware intelligent systems employ implicit inputs, and make decisions based on complex rules and machine learning models that are rarely clear to users. Such lack of system...
128
click to vote
SIGCSE
2009
ACM
16 years 5 months ago
2009
ACM
Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software sys...