Sciweavers

3241 search results - page 303 / 649
» Challenges for Dataset Search
Sort
View
ICIP
2007
IEEE
16 years 7 months ago
Common Spatial Pattern Discovery by Efficient Candidate Pruning
Automatically discovering common visual patterns in images is very challenging due to the uncertainties in the visual appearances of such spatial patterns and the enormous computa...
Junsong Yuan, Zhu Li, Yun Fu, Ying Wu, Thomas S. H...
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
16 years 5 months ago
Leveraging aggregate constraints for deduplication
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...
ICST
2009
IEEE
16 years 7 days ago
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi...
CIKM
2009
Springer
16 years 5 days ago
Leveraging a scalable row store to build a distributed text index
Many content-oriented applications require a scalable text index. Building such an index is challenging. In addition to the logic of inserting and searching documents, developers ...
Ning Li, Jun Rao, Eugene J. Shekita, Sandeep Tata
IWOMP
2009
Springer
16 years 4 days ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins