Sciweavers

109 search results - page 13 / 22
» Computing the betti numbers of arrangements
Sort
View
SAC
2005
ACM
14 years 2 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
FUIN
2010
143views more  FUIN 2010»
13 years 6 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
CCGRID
2009
IEEE
14 years 3 months ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
CVPR
2008
IEEE
14 years 11 months ago
Characterizing the shadow space of camera-light pairs
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...
CLOR
2006
14 years 21 days ago
Shared Features for Multiclass Object Detection
Abstract. We consider the problem of detecting a large number of different classes of objects in cluttered scenes. We present a learning procedure, based on boosted decision stumps...
Antonio B. Torralba, Kevin P. Murphy, William T. F...