Sciweavers

11588 search results - page 5 / 2318
» Will They Like This
Sort
View
ICSE
1999
IEEE-ACM
14 years 1 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
AAAI
2007
13 years 11 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
MM
2010
ACM
192views Multimedia» more  MM 2010»
13 years 9 months ago
iLike: integrating visual and textual features for vertical search
Content-based image search on the Internet is a challenging problem, mostly due to the semantic gap between low-level visual features and high-level content, as well as the excess...
Yuxin Chen, Nenghai Yu, Bo Luo, Xue-wen Chen
JOC
2008
92views more  JOC 2008»
13 years 8 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
PE
2008
Springer
109views Optimization» more  PE 2008»
13 years 8 months ago
A conditional probability approach to M/G/1-like queues
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
Alexandre Brandwajn, Hongyun Wang