Sciweavers

181 search results - page 29 / 37
» Negative selection algorithms without generating detectors
Sort
View
SPAA
2010
ACM
14 years 9 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
15 years 9 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen
IBPRIA
2007
Springer
15 years 3 months ago
Three-Dimensional Ultrasonic Assessment of Atherosclerotic Plaques
Carotid atherosclerosis is the most common life-threatening neurological disease and therefore an accurate assessment of atheromatous plaques is clinically important. Several studi...
José Seabra, João Sanches, Luí...
ECCV
2010
Springer
15 years 2 months ago
Error-tolerant Image Compositing
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...
COMPSAC
2000
IEEE
15 years 2 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang