Sciweavers

998 search results - page 74 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
EICS
2009
ACM
13 years 6 months ago
Ontology-based modularization of user interfaces
Modularization is almost the only feasible way of implementing large-scale applications. For user interfaces, interactions involving more than one module generate dependencies bet...
Heiko Paulheim
ICSOC
2010
Springer
13 years 6 months ago
Panta Rhei: Optimized and Ranked Data Processing over Heterogeneous Sources
In the era of digital information, the value of data resides not only in its volume and quality, but also in the additional information that can be inferred from the combination (a...
Daniele Braga, Francesco Corcoglioniti, Michael Gr...
COLING
2010
13 years 3 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
TASE
2010
IEEE
13 years 3 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
AAAI
1993
13 years 10 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler