Sciweavers

4761 search results - page 247 / 953
» Generalizing Boundary Points
Sort
View
GBRPR
2009
Springer
15 years 3 months ago
A First Step toward Combinatorial Pyramids in n-D Spaces
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...
Sébastien Fourey, Luc Brun
JMLR
2011
167views more  JMLR 2011»
15 years 24 days ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
15 years 12 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
ICCV
1999
IEEE
16 years 7 months ago
Trajectory Triangulation over Conic Sections
We consider the problem of reconstructing the 3D coordinates of a moving point seen from a monocular moving camera, i.e., to reconstruct moving objects from line-of-sight measurem...
Amnon Shashua, Shai Avidan, Michael Werman
CONEXT
2006
ACM
15 years 9 months ago
On the benefits of synchronized playout in peer-to-peer streaming
In this paper we examine the impact of the adopted playout policy on the overall performance of a P2P streaming system. It is argued and showed that adopting (popular) playout pol...
Constantinos Vassilakis, Nikolaos Laoutaris, Ioann...