Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2012

Highly Cited

2012

A Gelfand–Tsetlin scheme of depth $$N$$N is a triangular array with $$m$$m integers at level $$m$$m, $$m=1,\ldots ,N$$m=1,…,N… Expand

Is this relevant?

2011

2011

In large wireless sensor networks, low energy consumption is a major challenge. Hence, deployed nodes have to organize themselves… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

This paper examines the positional accuracy of the declassified KH-9 Hexagon imagery and derived DEM. Aimed at geodesy and… Expand

Is this relevant?

2009

2009

We compute the even part of the two-loop seven-point planar MHV amplitude in N = 4 supersymmetric Yang-Mills theory. We find that… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Abstract
Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

In this paper, we propose deployment patterns to achieve full coverage and three-connectivity, and full coverage and five… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

The art and technique of origami provides a surprising range of tools for explaining complicated mathematical concepts. Based on… Expand

Is this relevant?

2003

2003

A checkerboard constraint is a bounded measurable set S/spl sub/R/sup 2/, containing the origin. A binary labeling of the Z/sup 2… Expand

Is this relevant?

1996

1996

Abstract A hexagonal system is a finite 2-connected plane graph in which every interior face is bounded by a regular hexagon. A… Expand

Is this relevant?