Sciweavers

4843 search results - page 775 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
CVIU
2007
152views more  CVIU 2007»
15 years 3 months ago
A random sampling strategy for piecewise planar scene segmentation
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...
Adrien Bartoli
137
Voted
TIT
2008
72views more  TIT 2008»
15 years 3 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
136
Voted
CAD
2005
Springer
15 years 3 months ago
Surface interpolation of meshes by geometric subdivision
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
Xunnian Yang
135
Voted
WINET
2008
200views more  WINET 2008»
15 years 3 months ago
Performance evaluation of an IEEE 802.15.4 sensor network with a star topology
One class of applications envisaged for the IEEE 802.15.4 LR-WPAN (low data rate - wireless personal area network) standard is wireless sensor networks for monitoring and control a...
Chandramani Kishore Singh, Anurag Kumar, P. M. Ame...
153
Voted
AI
2002
Springer
15 years 3 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm