Sciweavers

2254 search results - page 290 / 451
» Computing the minimal covering set
Sort
View
COMPGEOM
2009
ACM
16 years 23 days ago
High resolution surface reconstruction from overlapping multiple-views
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
Nader Salman, Mariette Yvinec
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
16 years 9 days ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
GCC
2005
Springer
15 years 11 months ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
ISPAN
1997
IEEE
15 years 10 months ago
A Parallel Pipelined Renderer for Time-Varying Volume Data
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
Tzi-cker Chiueh, Kwan-Liu Ma
CVPR
2009
IEEE
17 years 1 months ago
Learning from Ambiguously Labeled Images
In many image and video collections, we have access only to partially labeled data. For example, personal photo collections often contain several faces per image and a caption t...
Benjamin Sapp, Benjamin Taskar, Chris Jordan, Timo...