Sciweavers

313 search results - page 22 / 63
» Complete Local Search with Memory
Sort
View
SC
2004
ACM
14 years 3 months ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
ALMOB
2006
80views more  ALMOB 2006»
13 years 10 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
DCOSS
2010
Springer
14 years 1 months ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 3 months ago
Statistical similarity search applied to content-based video copy detection
—Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer ...
Alexis Joly, Olivier Buisson, Carl Frélicot
AAAI
2006
13 years 11 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche