Sciweavers

2370 search results - page 236 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
AAAI
2007
15 years 6 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
156
Voted
AIRWEB
2008
Springer
15 years 6 months ago
Query-log mining for detecting spam
Every day millions of users search for information on the web via search engines, and provide implicit feedback to the results shown for their queries by clicking or not onto them...
Carlos Castillo, Claudio Corsi, Debora Donato, Pao...
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Fault tolerant nanoelectronic processor architectures
In this paper we propose a fault-tolerant processor architecture and an associated fault-tolerant computation model capable of fault tolerance in the nanoelectronic environment th...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
15 years 6 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi
COCOON
2008
Springer
15 years 5 months ago
Probe Ptolemaic Graphs
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van...