Sciweavers

1578 search results - page 251 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
AIPS
2008
14 years 9 days ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
EDBT
2010
ACM
177views Database» more  EDBT 2010»
13 years 12 months ago
PerK: personalized keyword search in relational databases through preferences
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
Kostas Stefanidis, Marina Drosou, Evaggelia Pitour...
GRAPHICSINTERFACE
2007
13 years 11 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
ESWA
2006
103views more  ESWA 2006»
13 years 10 months ago
Model gene network by semi-fixed Bayesian network
Gene networks describe functional pathways in a given cell or tissue, representing processes such as metabolism, gene expression regulation, and protein or RNA transport. Thus, le...
Tie-Fei Liu, Wing-Kin Sung, Ankush Mittal
ECCC
2007
123views more  ECCC 2007»
13 years 10 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters