Sciweavers

562 search results - page 45 / 113
» Dependency Pairs Revisited
Sort
View
CVPR
2010
IEEE
15 years 6 months ago
Model Globally, Match Locally: Efficient and Robust 3D Object Recognition
This paper addresses the problem of recognizing freeform 3D objects in point clouds. Compared to traditional approaches based on point descriptors, which depend on local informati...
Bertram Drost, Markus Ulrich, Nassir Navab, Slobod...
CORR
2007
Springer
176views Education» more  CORR 2007»
15 years 1 months ago
Crystallization in large wireless networks
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
Veniamin I. Morgenshtern, Helmut Bölcskei
84
Voted
COGSCI
2004
80views more  COGSCI 2004»
15 years 1 months ago
The conjunction fallacy: a misunderstanding about conjunction?
It is easy to construct pairs of sentences X, Y that lead many people to ascribe higher probability to the conjunction X-and-Y than to the conjuncts X, Y. Whether an error is ther...
Katya Tentori, Nicolao Bonini, Daniel N. Osherson
JOI
2010
121views more  JOI 2010»
15 years 9 days ago
Consistent bibliometric rankings of authors and of journals
Rankings of journals and rankings of scientists are usually discussed separately. We argue that a consistent approach to both rankings is desirable because both the quality of a j...
Denis Bouyssou, Thierry Marchant
PODC
2009
ACM
16 years 2 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...