3818 search results - page 411 / 764 » Word Problems on Compressed Words |
291
click to vote
CANDC
2005
ACM
15 years 6 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
171
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
159
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
168
click to vote
JACM
2002
15 years 6 months ago
2002
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
186
click to vote
DKE
1999
15 years 6 months ago
1999
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...