Sciweavers

169 search results - page 22 / 34
» Decentralized Search with Random Costs
Sort
View
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 6 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
INFOCOM
2009
IEEE
14 years 1 months ago
Opportunistic Processing and Query of Motion Trajectories in Wireless Sensor Networks
—We study the problem of in-network processing and queries of trajectories of moving targets in a sensor network. The main idea is to exploit the spatial coherence of target traj...
Dengpan Zhou, Jie Gao
AAAI
1996
13 years 8 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
ICML
2010
IEEE
13 years 7 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
COR
2011
13 years 1 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic