Sciweavers

1431 search results - page 125 / 287
» The complexity of random ordered structures
Sort
View
VMCAI
2004
Springer
15 years 8 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
ECAI
2008
Springer
15 years 5 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
IMAMS
2003
212views Mathematics» more  IMAMS 2003»
15 years 4 months ago
Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis
Watermarking is to embed a structure called a watermark into the target data such as images. The watermark can be used, for example, in order to secure the copyright and detect tam...
Kohei Muratani, Kokichi Sugihara
PVLDB
2010
200views more  PVLDB 2010»
15 years 1 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
ACL
2009
15 years 1 months ago
Semantic Tagging of Web Search Queries
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
Mehdi Manshadi, Xiao Li