Sciweavers

1689 search results - page 153 / 338
» Proximate point searching
Sort
View
MP
2008
129views more  MP 2008»
15 years 6 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
IJCGA
2010
99views more  IJCGA 2010»
15 years 4 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
PVLDB
2010
116views more  PVLDB 2010»
15 years 1 months ago
Computing Closed Skycubes
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
Chedy Raïssi, Jian Pei, Thomas Kister
CORR
2011
Springer
215views Education» more  CORR 2011»
15 years 28 days ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
MIR
2010
ACM
206views Multimedia» more  MIR 2010»
16 years 1 months ago
3d object retrieval using salient views
This paper presents a method for selecting salient 2D views to describe 3D objects for the purpose of retrieval. The views are obtained by first identifying salient points via a ...
Indriyati Atmosukarto, Linda G. Shapiro