Sciweavers

849 search results - page 47 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
AAAI
2012
11 years 10 months ago
Threats and Trade-Offs in Resource Critical Crowdsourcing Tasks Over Networks
In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incentivi...
Swaprava Nath, Pankaj Dayama, Dinesh Garg, Y. Nara...
AMW
2010
13 years 9 months ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
Loreto Bravo, Mónica Caniupán Marile...
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
14 years 1 months ago
Faster exploration of high level design alternatives using UML for better partitions
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
Waseem Ahmed, Doug Myers
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 2 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
ESA
2006
Springer
112views Algorithms» more  ESA 2006»
13 years 11 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...