Sciweavers

1403 search results - page 230 / 281
» Set cover algorithms for very large datasets
Sort
View
FLAIRS
2006
14 years 11 months ago
Focusing Strategies for Multiple Fault Diagnosis
Diagnosing multiple faults for a complex system is often very difficult. It requires not only a model which adequately represents the diagnostic aspect of a complex system, but al...
Tsai-Ching Lu, K. Wojtek Przytula
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
15 years 4 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
CVPR
2010
IEEE
15 years 1 months ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li
CIKM
2010
Springer
14 years 8 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
TCAD
2008
195views more  TCAD 2008»
14 years 9 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...