Sciweavers

2192 search results - page 155 / 439
» Algorithms for Challenging Motif Problems
Sort
View
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
14 years 8 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...
CVPR
2010
IEEE
14 years 4 months ago
Safety in Numbers: Learning Categories from Few Examples with Multi Model Knowledge Transfer
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
Tatiana Tommasi, Francesco Orabona, Barbara Caputo
ICST
2009
IEEE
14 years 3 months 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...
IEEEIAS
2008
IEEE
14 years 2 months ago
Network Level Privacy for Wireless Sensor Networks
Full network level privacy spectrum comprises of identity, route, location and data privacy. Existing privacy schemes of wireless sensor networks only provide partial network leve...
Riaz Ahmed Shaikh, Hassan Jameel, Brian J. d'Aurio...
TPHOL
2007
IEEE
14 years 2 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka