2239 search results - page 71 / 448 » Computing with abstract matrix structures |
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
112
click to vote
COMPGEOM
1997
ACM
15 years 4 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
ECCV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. With the emergence of swept-volume ultrasound (US) probes, precise and almost real-time US volume imaging has become available. This offers many new opportunities for com...
100
click to vote
IJFCS
2006
14 years 11 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...