Sciweavers

697 search results - page 83 / 140
» Approximation of Information Granule Sets
Sort
View
LCPC
1994
Springer
14 years 2 months ago
Minimal Data Dependence Abstractions for Loop Transformations
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
Yi-Qing Yang, Corinne Ancourt, François Iri...
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 9 months ago
Using a Diathesis Model for Semantic Parsing
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
Jordi Atserias, Irene Castellón, Montse Civ...
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
13 years 8 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
JMLR
2008
159views more  JMLR 2008»
13 years 10 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 10 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith