Sciweavers

920 search results - page 128 / 184
» How Complex is Discourse Structure
Sort
View
103
Voted
ICML
2003
IEEE
16 years 3 months ago
On Kernel Methods for Relational Learning
Kernel methods have gained a great deal of popularity in the machine learning community as a method to learn indirectly in highdimensional feature spaces. Those interested in rela...
Chad M. Cumby, Dan Roth
131
Voted
WWW
2001
ACM
16 years 3 months ago
An Effective and User-Friendly IDE Tool to Facilitate Conceptual Design and Maintenance of Web Applications
Web applications are growing in demand, complexity and size, thus making it difficult to systematically design and maintain general web applications. To aid in fulfilling these di...
Vincent Tam, C. S. Yeo
CP
2009
Springer
16 years 3 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
131
Voted
VLSID
2003
IEEE
180views VLSI» more  VLSID 2003»
16 years 3 months ago
Automating Formal Modular Verification of Asynchronous Real-Time Embedded Systems
Most verification tools and methodologies such as model checking, equivalence checking, hardware verification, software verification, and hardware-software coverification often fl...
Pao-Ann Hsiung, Shu-Yu Cheng
139
Voted
CADE
2005
Springer
16 years 2 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill