6358 search results - page 1065 / 1272 » Computing spectral sequences |
158
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
194
click to vote
RECOMB
1999
Springer
15 years 10 months ago
1999
Springer
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
230
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
217
click to vote
HPCN
2000
Springer
15 years 10 months ago
2000
Springer
We build an analytical model for an application utilizing master-slave paradigm. In the model, only three architecture parameters are used: latency, bandwidth and flop rate. Instea...
213
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Starting from existing spreadsheet software, like Lotus 1-23R , ExcelR , or Spreadsheet 2000R , we propose a sequence of enhancements to fully integrate constraint-based ...