Sciweavers

496 search results - page 64 / 100
» Machine models and lower bounds for query processing
Sort
View
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
ER
2006
Springer
158views Database» more  ER 2006»
13 years 11 months ago
Database to Semantic Web Mapping Using RDF Query Languages
One of the main drawbacks of the Semantic Web is the lack of semantically rich data, since most of the information is still stored in relational databases. In this paper, we presen...
Cristian Pérez de Laborda, Stefan Conrad
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
ICIP
2005
IEEE
14 years 9 months ago
Variational segmentation of color images
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...
Nikolaos Nasios, Adrian G. Bors
FOCS
2009
IEEE
14 years 2 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams