Sciweavers

8647 search results - page 519 / 1730
» The Container Selection Problem
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Bayesian clustering for email campaign detection
We discuss the problem of clustering elements according to the sources that have generated them. For elements that are characterized by independent binary attributes, a closedform...
Peter Haider, Tobias Scheffer
ECSQARU
2009
Springer
16 years 1 months ago
A Default Logic Patch for Default Logic
This paper is about the fusion of multiple information sources represented using default logic. More precisely, the focus is on solving the problem that occurs when the standard-lo...
Philippe Besnard, Éric Grégoire, S&e...
IAT
2007
IEEE
16 years 1 months ago
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resource...
Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, J...
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
16 years 1 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
16 years 1 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari