Sciweavers

1132 search results - page 163 / 227
» Structural Average Case Complexity
Sort
View
JFP
2006
113views more  JFP 2006»
13 years 9 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
ASE
2002
141views more  ASE 2002»
13 years 8 months ago
On the Automatic Recovery of Style-Specific Architectural Relations in Software Systems
The cost of maintaining a software system over a long period of time far exceeds its initial development cost. Much of the maintenance cost is attributed to the time required by ne...
Martin Traverso, Spiros Mancoridis
PAMI
2007
164views more  PAMI 2007»
13 years 8 months ago
Space-Time Completion of Video
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...
Yonatan Wexler, Eli Shechtman, Michal Irani
CMPB
2010
97views more  CMPB 2010»
13 years 7 months ago
A ligand predication tool based on modeling and reasoning with imprecise probabilistic knowledge
Ligand prediction has been driven by a fundamental desire to understand more about how biomolecules recognize their ligands and by the commercial imperative to develop new drugs. ...
Weiru Liu, Anbu Yue, David J. Timson
TCS
2010
13 years 3 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal