In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices with no outgoing edges.That is, the graph shouldâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2009

Highly Cited

2009

- Thibaut Weise, Thomas Wismer, Bastian Leibe, Luc van Gool
- 2009 IEEE 12th International Conference onâ€¦
- 2009

We present a complete 3D in-hand scanning system that allows users to scan objects by simply turning them freely in front of aâ€¦Â (More)

Is this relevant?

2008

2008

- Michal Karczmarek, Arvind
- 2008 IEEE/ACM International Conference onâ€¦
- 2008

One solution to the timing closure problem is to perform infrequent operations in more than one cycle. Despite simplicity of theâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- A Beurling
- 2006

T n "0 We shall denote by Cf and C$ the closed linear manifolds spanned by { f}o and {T*'g}o, respectively; f , g being elementsâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Rachel Kolodny, Leonidas J. Guibas, Michael Levitt, Patrice Koehl
- I. J. Robotics Res.
- 2005

Assembling fragments from known protein structures is a widely used approach to construct structural models for new proteins. Weâ€¦Â (More)

Is this relevant?

2005

2005

- Wouter Boomsma, Thomas Hamelryck
- BMC Bioinformatics
- 2005

Various forms of the so-called loop closure problem are crucial to protein structure prediction methods. Given an N- and a Câ€¦Â (More)

Is this relevant?

2000

2000

- Dorit S. Hochbaum, Maurice Queyranne
- ESA
- 2000

Many applications in the area of production and statistical estimation are problems of convex optimization subject to rankingâ€¦Â (More)

Is this relevant?

1995

1995

- Maria Luisa Bonet, Samuel R. Buss
- SIAM J. Comput.
- 1995

The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edgesâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Geir Evensen
- 1994

A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methodsâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Jeffrey D. Ullman, Mihalis Yannakakis
- SPAA
- 1990

There is a straightforward algorithm for computing the transitive closure of an n-node directed graph in O(log2 n) time on anâ€¦Â (More)

Is this relevant?

1987

1987

- Sun-Yuan Kung, Sheng-Chun Lo, Paul S. Lewis
- IEEE Transactions on Computers
- 1987

Due to VLSI technological progress, algorithm- oriented array architectures, such as systolic arrays, appear to be very effectiveâ€¦Â (More)

Is this relevant?