Sciweavers

17541 search results - page 3506 / 3509
» Complexity in scalable computing
Sort
View
MLMI
2004
Springer
14 years 13 days ago
Towards Predicting Optimal Fusion Candidates: A Case Study on Biometric Authentication Tasks
Combining multiple information sources, typically from several data streams is a very promising approach, both in experiments and to some extend in various real-life applications. ...
Norman Poh, Samy Bengio
CVPR
2006
IEEE
14 years 9 months ago
Acceleration Strategies for Gaussian Mean-Shift Image Segmentation
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
Miguel Á. Carreira-Perpiñán
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 7 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
GI
2007
Springer
14 years 1 months ago
Auf dem Weg zur allwissenden Fabrik: Vertikale Integration auf Basis kontinuierlicher Datenverarbeitung
: In modernen Produktionsunternehmen gilt mehr denn je die Devise Zeit ist Geld. Daher ist eine zeitnahe Reaktion auf Vorfälle und Entwicklungen innerhalb der eigenen Produktion a...
Christoph Heinz, Jürgen Krämer, Tobias R...
COMPGEOM
2010
ACM
14 years 5 days ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
« Prev « First page 3506 / 3509 Last » Next »