Sciweavers

1688 search results - page 181 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ECCV
1996
Springer
16 years 1 months ago
Automatic Extraction of Generic House Roofs from High Resolution Aerial Imagery
We present a technique to extract complex suburban roofs from sets of aerial images. Because we combine 2-D edge information, photometric and chromatic attributes and 3-D informati...
Frank Bignone, Olof Henricsson, Pascal Fua, Markus...
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
16 years 1 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
15 years 12 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
SOFSEM
2007
Springer
15 years 5 months ago
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems
Abstract. The increasing complexity of today’s embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to softw...
Dietmar Schreiner, Karl M. Göschka
ICPP
1992
IEEE
15 years 3 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç