Sciweavers

1559 search results - page 136 / 312
» Some Group Theory Problems
Sort
View
SIGACT
2008
103views more  SIGACT 2008»
15 years 4 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
IPPS
1999
IEEE
15 years 8 months ago
Examples of Program Composition Illustrating the Use of Universal Properties
Abstract. This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared ...
Michel Charpentier, K. Mani Chandy
SIAMJO
2002
73views more  SIAMJO 2002»
15 years 4 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
INFOCOM
2005
IEEE
15 years 10 months ago
A beacon-less location discovery scheme for wireless sensor networks
— In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of l...
Lei Fang, Wenliang Du, Peng Ning
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind